login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071580 Smallest prime == 1 mod (a(n-1)*a(n-2)*...*a(1)) for n>=2 with a(1)=2. 0
2, 3, 7, 43, 3613, 65250781, 5109197227031017, 21753246920584523633819544186061, 993727878334632126576336773629979379563850938567846991629270287 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(6) through a(13), with digit lengths 8, 16, 32, 63, 127, 253, 507 and 1012, respectively, have been certified prime with Primo.

PROG

(PARI) terms=13; v=vector(terms); p=2; v[1]=p; for(n=2, terms, q=p+1; while(!isprime(q), q=q+p); v[n]=q; p=p*q); v

CROSSREFS

Cf. A061092.

Sequence in context: A000058 A075442 A082993 * A014546 A068393 A032053

Adjacent sequences:  A071577 A071578 A071579 * A071581 A071582 A071583

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 31 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:32 EST 2012. Contains 205860 sequences.