Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090475 Beginning with 2, a(n+1) is the least prime == -1 (mod (product a(i), i=1 to n)). +0
3
2, 3, 5, 29, 2609, 2269829, 20608503836279, 3397683442959574948323216959, 42930190020276065993287927763424183433168916230440704129, 11925301980557128262646397395757349509547235978932865385629186778490359004982967\ 09057759892487138176511608345909 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A090474, A090476.

Sequence in context: A073309 A110389 A083388 this_sequence A060301 A040119 A106308

Adjacent sequences: A090472 A090473 A090474 this_sequence A090476 A090477 A090478

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 02 2003

EXTENSIONS

Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Nov 16 2005

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research