[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 8
2, 2, 19, 199, 2089, 99109, 1960969, 10129129, 87726649, 4549584049, 328034245549, 20584643748679, 666188861477149, 31395465477725359, 894857713367947339, 434392154438254391389, 17934770256689308411399 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Thanks in part to Dirichlet's theorem, a(n) exists for each n. - Don Reble, Oct 07 2006
LINKS
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,23,881,...};
a(5) = 2089 because it generates {2089,2,3,5,7,11,269,...};
a(6) = 99109 because it generates {99109,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,173,...}
CROSSREFS
Sequence in context: A141084 A172194 A338400 * A326177 A370709 A103129
KEYWORD
nonn
AUTHOR
Labos Elemer, May 03 2004
EXTENSIONS
More terms from Don Reble, Oct 07 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 17:19 EDT 2024. Contains 375518 sequences. (Running on oeis4.)