login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Main diagonal of A083809.
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
Sequence in context: A120952 A270404 A270315 * A215209 A274600 A352625
KEYWORD
nonn
AUTHOR
Amarnath Murthy, May 08 2003
EXTENSIONS
Edited, corrected and extended by Klaus Brockhaus, May 13 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 04:35 EDT 2024. Contains 375018 sequences. (Running on oeis4.)