A369952 a(n) is the number of distinct values of the permanent of an n X n Hankel matrix using the first 2*n - 1 prime numbers.

1, 1, 2, 59, 2493, 180932, 19939272

Offset

0,3

Links

Table of n, a(n) for n=0..6.

Wikipedia, Hankel matrix.

Mathematica

a[n_] := CountDistinct[Table[Permanent[HankelMatrix[Join[Drop[per = Part[Permutations[Prime[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, matpermanent(matrix(n, n, i, j, prime(p[i+j-1])))); ); #Set(list); \\ Michel Marcus, Feb 08 2024
(Python)
from itertools import permutations
from sympy import primerange, prime, Matrix
def A369952(n): return len({Matrix([p[i:i+n] for i in range(n)]).per() for p in permutations(primerange(prime((n<<1)-1)+1))}) if n else 1 # Chai Wah Wu, Feb 12 2024

Crossrefs

Cf. A290302, A350939, A350940.

Sequence in context: A051055 A003827 A241324 * A139190 A050283 A096758

Adjacent sequences: A369949 A369950 A369951 * A369953 A369954 A369955

Keyword

nonn,hard,more

Author

Stefano Spezia, Feb 06 2024

Extensions

a(6) from Michel Marcus, Feb 08 2024

Status

approved