Keeping the Rearrangement Theorem in mind. The first part of the answer is how many ways we can write a multiplication table of size nxn that have all it rows and columns with no repeated element.
Second part to the answer is out of the number that was calculated in first part how many isomorphic groups we can eliminate?
for example we can prove that all columns permutations will yield isomorphic groups by mapping the first rows of any of those with the permutation done.
what is the general formula for n in the first part? And is there is a formula for the second part, or it all done by brute force? if so how far is known?