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!)
A053546 Smallest prime containing a leading sequence of n ascending numbers. 5
11, 127, 1231, 12343, 123457, 12345623, 123456719, 1234567801, 1234567891, 1234567891003, 12345678910111, 12345678910111207, 1234567891011121309, 123456789101112131449, 12345678910111213141523, 123456789101112131415161, 123456789101112131415161717 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The Magma Calculator (http://magma.maths.usyd.edu.au/calc/) verified each of the 100 terms in the table as prime. - Jon E. Schoenfield, Aug 24 2009
Can this sequence be proved to be infinite, a sort of Dirichlet's Theorem in reverse? - Charles R Greathouse IV, Jul 23 2011
LINKS
T. D. Noe, Table of n, a(n) for n = 1..100 (probable primes)
EXAMPLE
a(6) = 12345623 is the smallest prime beginning with the string 123456.
MATHEMATICA
sp[n_]:=Module[{m=1, np}, np=NextPrime[n*10^m]; While[Floor[np/10^m] != n, m++; np=NextPrime[n*10^m]]; np]; sp/@Table[FromDigits[ Flatten[ IntegerDigits/@ Range[x]]], {x, 20}] (* Harvey P. Dale, May 22 2016 *)
CROSSREFS
Sequence in context: A048394 A088628 A069599 * A084975 A065543 A015598
KEYWORD
base,easy,nice,nonn
AUTHOR
Enoch Haga, Jan 16 2000
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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)