|
|
A098778
|
|
a(n) is the least k such that (k*prime(n)#)^2 + 1 is prime, where prime(n)# is the n-th primorial.
|
|
1
|
|
|
1, 1, 3, 1, 1, 12, 7, 1, 13, 13, 7, 10, 13, 6, 4, 1, 6, 46, 12, 27, 15, 40, 31, 14, 17, 9, 26, 9, 7, 5, 23, 27, 26, 2, 5, 9, 5, 24, 17, 23, 26, 166, 110, 2, 24, 87, 6, 113, 116, 3, 140, 12, 93, 26, 2, 15, 63, 15, 2, 143, 19, 19, 27, 122, 26, 28, 206, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MATHEMATICA
|
a[n_] := Module[{k = 1, p = Product[Prime[i], {i, 1, n}]}, While[! PrimeQ[(k*p)^2 + 1], k++]; k]; Array[a, 70] (* Amiram Eldar, Aug 28 2021 *)
|
|
PROG
|
(PARI) a(n) = my(k=1, P=prod(k=1, n, prime(k))); while (!ispseudoprime(sqr(k*P)+1), k++); k; \\ Michel Marcus, Sep 12 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|