login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090475 Beginning with 2, a(n+1) is the least prime == -1 (mod Product_{i=1..n} a(i) ). 3
2, 3, 5, 29, 2609, 2269829, 20608503836279, 3397683442959574948323216959, 42930190020276065993287927763424183433168916230440704129, 1192530198055712826264639739575734950954723597893286538562918677849035900498296709057759892487138176511608345909 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..10.

PROG

(PARI) terms=12; p=2; print1("2, "); for(n=2, terms, q=p-1; while(!ispseudoprime(q), q=q+p); print1(q, ", "); p=p*q) \\ Serge Batalov, May 22 2015

CROSSREFS

Cf. A090474, A090476, A071580, A258081.

Sequence in context: A226124 A110389 A083388 * A060301 A040119 A186635

Adjacent sequences:  A090472 A090473 A090474 * A090476 A090477 A090478

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Dec 02 2003

EXTENSIONS

Corrected and extended by David Wasserman, Nov 16 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 21:32 EDT 2020. Contains 337910 sequences. (Running on oeis4.)