|
|
A321611
|
|
Number of permutations tau of {1,...,n} such that k^4 + tau(k)^4 is prime for every k = 1,...,n.
|
|
7
|
|
|
1, 1, 1, 4, 4, 4, 4, 64, 16, 144, 144, 0, 144, 144, 289, 4356, 2916, 22500, 79524, 1887876, 313600, 3459600, 2985984, 50069776, 32353344, 2056803904, 237591396, 11713732900, 10265337124, 342040164964, 30744816964, 2507750953744, 378640854244, 53517915572836, 7415600385600, 230030730231696
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Conjecture: Each term of the sequence is a positive square.
This conjecture fails for n = 12. The values of a(12),...,a(20) were first computed by the user MTson on Mathoverflow. Ilya Bogdanov has confirmed that a(n) is indeed a square. See answers and comments to Question 315351 on Mathoverflow. - Zhi-Wei Sun, Nov 17 2018
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 1, and (1,3,2) is a permutation of {1,...,n} with 1^4 + 1^4 = 2, 2^4 + 3^4 = 97 and 3^4 + 2^4 = 97 all prime.
|
|
MATHEMATICA
|
V[n_]:=V[n]=Permutations[Table[i, {i, 1, n}]]
Do[r=0; Do[Do[If[PrimeQ[i^4+Part[V[n], k][[i]]^4]==False, Goto[aa]], {i, 1, n}]; r=r+1; Label[aa], {k, 1, n!}]; Print[n, " ", r], {n, 1, 11}]
|
|
PROG
|
(PARI) a(n) = matpermanent(matrix(n, n, i, j, ispseudoprime(i^4 + j^4))); \\ Jinyuan Wang, Jun 13 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|