Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071580 Smallest prime == 1 mod (a(n-1)*a(n-2)*...*a(1)) for n>=2 with a(1)=2. +0
1
2, 3, 7, 43, 3613, 65250781, 5109197227031017, 21753246920584523633819544186061, 993727878334632126576336773629979379563850938567846991629270287 (list; graph; listen)
OFFSET

1,1

COMMENT

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

PROGRAM

(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 this_sequence A014546 A068393 A032053

Adjacent sequences: A071577 A071578 A071579 this_sequence A071581 A071582 A071583

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research