|
|
A083810
|
|
a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).
|
|
2
|
|
|
2, 7, 59, 47, 1699, 22697, 1180247, 29962733, 1038006719, 411043979, 295951664941, 439109442193, 84309012901073, 1566310690709, 399766531626388768981, 71604415998366709, 180443128315884106709
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
PROG
|
(PARI 2.1.3) for(n=1, 18, q=n; for(k=1, n, m=1; while(!isprime(p=m*q+1, 1), m++); q=p); print1(q, ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|