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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283247 a(n) is the smallest prime number whose representation contains as a substring the first n digits of Pi in base 10. 0
3, 31, 13147, 73141, 314159, 314159, 131415923, 1314159269, 23141592653, 23141592653, 314159265359, 3141592653581, 213141592653589, 1131415926535897, 9314159265358979, 173141592653589793, 3141592653589793239, 3141592653589793239, 314159265358979323861 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Pi progresses as 3, 31, 314, 3141, hence minimal prime numbers that do this are 3, 31, 13147, 73141. While there are other primes that contain, say, 314, the prime number, 13147 is the first prime to do so.

It is probably provable that this is an infinite sequence. Notice that 314159 appears twice in the sequence since 314159 is the smallest prime that contains 31415 as well as 314159.

LINKS

Table of n, a(n) for n=1..19.

Manan Shah, A Pi Containing Prime Number Sequence

EXAMPLE

a(4) = 73141 since 73141 is the smallest prime number that contains 3141 (the first 4 digits of Pi).

a(5) = 314159 since 314159 is the smallest prime number that contains 31415.

a(6) = 314159 since 314159 is the smallest prime number that contains 314159.

MATHEMATICA

pp[n_] := If[PrimeQ@n, n, Block[{d = IntegerDigits@n, p, s, t}, p = 10^Length[d]; s = Select[Join[Range[9] p + n, {1, 3, 7, 9} + 10 n], PrimeQ]; If[s != {}, Min@s, s = NextPrime[100 n]; t = Join[If[Floor[s/100] == n, {s}, {}], Range[10, 99] p + n, FromDigits /@ Flatten /@ Tuples[{Range@9, {d}, {1, 3, 7, 9}}]]; s = Select[t, PrimeQ]; If[s == {}, 0, Min@s]]]]; Table[pp[Floor[10^e Pi]], {e, 0, 18}] (* Giovanni Resta, Jul 21 2017 *)

PROG

(Python 3.6.x)

pi_digits = pi_digit_generator #user-defined generator for producing next digit of Pi

next_digit = pi_digits.next() #first call, so next_digit = 3

primes = prime_generator #user-defined generator for producing next prime

current_prime = primes.next() #first call, so current_prime = 2

pi_progress = 0

while True:

    pi_progress = pi_progress*10 + next_digit

    while str(pi_progress) not in str(current_prime):

        current_prime = primes.next()

    print(pi_progress, current_prime)

CROSSREFS

Cf. A005042, A282973.

Sequence in context: A129209 A134721 A002707 * A261472 A144964 A168678

Adjacent sequences:  A283244 A283245 A283246 * A283248 A283249 A283250

KEYWORD

nonn,base

AUTHOR

Manan Shah, Jul 20 2017

EXTENSIONS

a(7)-a(19) from Giovanni Resta, Jul 21 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 17:56 EST 2017. Contains 294894 sequences.