login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A369942
a(n) is the number of distinct values of the determinant of an n X n Hankel matrix using the integers 1 to 2*n - 1.
1
1, 1, 3, 49, 1480, 50522, 2517213
OFFSET
0,3
MATHEMATICA
a[n_] := CountDistinct[Table[Det[HankelMatrix[Join[Drop[per = Part[Permutations[Range[2 n - 1]], i], n], {Part[per, n]}], Join[{Part[per, n]}, Drop[per, - n]]]], {i, (2 n - 1) !}]]; Join[{1}, Array[a, 5]]
PROG
(PARI) a(n) = my(v=[1..2*n-1], list=List()); forperm(v, p, listput(list, matdet(matrix(n, n, i, j, p[i+j-1]))); ); #Set(list); \\ Michel Marcus, Feb 08 2024
(Python)
from itertools import permutations
from sympy import Matrix
def A369942(n): return len({Matrix([p[i:i+n] for i in range(n)]).det() for p in permutations(range(1, n<<1))}) # Chai Wah Wu, Feb 12 2024
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Stefano Spezia, Feb 06 2024
EXTENSIONS
a(6) from Michel Marcus, Feb 08 2024
STATUS
approved