Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093777
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093777 a(n) is the smallest prime which, if used to start a Euclid-Mullin sequence (like A000945), the resulting sequence contains the n consecutive primes 2,3,...,prime(n). +0
8
2, 2, 19, 199, 2089, 99109, 1960969, 10129129, 87726649, 4549584049, 328034245549, 20584643748679, 666188861477149, 31395465477725359, 894857713367947339, 434392154438254391389, 17934770256689308411399 (list; graph; listen)
OFFSET

1,1

COMMENT

Thanks in part to Dirichlet's theorem, a(n) exists for each n. - Don Reble, Oct 07 2006

EXAMPLE

a[1]=a[2]=2 because they generate {2,3,7,43,13,...};

a[3]=19 because it generates {19,2,3,5,571,271,..}, see A051312;

a[4]=199 because it generates {199,2,3,5,7,881,..};

a[5]=2089 because it generates {2089,2,3,5,7,11,269,..};

a[6]=99019 because it generates {99089,2,3,5,7,11,13,2976243271,..};

a[7]=1960969 because it generates {1960969,2,3,5,7,11,13,17,281,47,419,5539788476533581271,37,19,73,..}

CROSSREFS

Cf. A093778-A093780, A000945, A051309-A051334, A051614, A051614-A051616, A056756.

Sequence in context: A096190 A136434 A001183 this_sequence A103129 A009340 A053593

Adjacent sequences: A093774 A093775 A093776 this_sequence A093778 A093779 A093780

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 03 2004

EXTENSIONS

More terms from Don Reble, Oct 07 2006

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research