This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A369952 #15 Feb 12 2024 13:42:51
%S A369952 1,1,2,59,2493,180932,19939272
%N 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.
%H A369952 Wikipedia, <a href="https://en.wikipedia.org/wiki/Hankel_matrix">Hankel matrix</a>.
%t A369952 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]]
%o A369952 (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
%o A369952 (Python)
%o A369952 from itertools import permutations
%o A369952 from sympy import primerange, prime, Matrix
%o A369952 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
%Y A369952 Cf. A290302, A350939, A350940.
%K A369952 nonn,hard,more
%O A369952 0,3
%A A369952 _Stefano Spezia_, Feb 06 2024
%E A369952 a(6) from _Michel Marcus_, Feb 08 2024