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).

13, 299, 5229, 75961, 715492, 11137824, 135224164

Offset: 1

Author

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

Keywords

• nonn
• base
• more

Comments

a(8) requires more than 10^9 digits of Pi. - Michael S. Branicky, Jul 08 2021

Examples

			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
		

Links

• Carlos Rivera, Puzzle 40. The Pi Prime Search Puzzle (by Patrick De Geest), The Prime Puzzles and Problems Connection.

Crossrefs

Cf. A000796, A047658, A076094, A076129, A076106.

Programs

Python

# uses function in A076106
print([A076106_A076130(n)[1] for n in range(1, 6)]) # Michael S. Branicky, Jul 08 2021

Extensions

Edited by Charles R Greathouse IV, Aug 02 2010

Definition clarified by N. J. A. Sloane, Nov 28 2019

a(7) from Michael S. Branicky, Jul 08 2021