This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076130 Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is A076106(n) and the position where this prime appears is a(n). 1

%I

%S 13,299,5229,75961,715492,11137824

%N Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is A076106(n) and the position where this prime appears is a(n).

%H Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_040.htm">Puzzle 40. The Pi Prime Search Puzzle (by Patrick De Geest)</a>, The Prime Puzzles and Problems Connection.

%e Of all the 2-digit primes, 11 to 97, the last one to appear in Pi is 73, at position 299 (see A076106). - _N. J. A. Sloane_, Nov 28 2019

%Y Cf. A047658, A076094, A076129, A076106.

%K nonn,base,more,changed

%O 1,1

%A Jean-Christophe Colin (jc-colin(AT)wanadoo.fr), Oct 31 2002

%E Edited by _Charles R Greathouse IV_, Aug 02 2010

%E Definition clarified by _N. J. A. Sloane_, Nov 28 2019

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

Last modified December 9 13:50 EST 2019. Contains 329877 sequences. (Running on oeis4.)