login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088603 a(n) = smallest prime in which n substrings containing the most significant digit are primes. 4
2, 23, 233, 2333, 23333, 233993, 2339933, 23399339, 1979339333, 23339531339, 293999994791, 3733799959397, 233323747999733, 2333939994739931, 23833939369399333, 238339393693993337, 23833939369399333613 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Agrees with A127889 for 8 terms, but A127889 ends there while this sequence continues. - Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 13 2007

PROG

(PARI) f(n, d, spare) = local(p, r); if (!d, return(n)); for (i = 0, 9, p = 10*n + i; if (isprime(p) || spare, r = f(p, d - 1, spare - 1 + isprime(p))); if (r, return(r))); 0; a(n) = local(i, r); i = 0; while (1, r = f(0, n + i, i); if (r, return(r), i++)); (Wasserman)

CROSSREFS

Cf. A088604, A127889.

Sequence in context: A198972 A065122 A127889 * A048549 A158191 A089703

Adjacent sequences:  A088600 A088601 A088602 * A088604 A088605 A088606

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 15 2003

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:14 EST 2012. Contains 206031 sequences.