%I #23 Aug 22 2021 00:14:10
%S 13,299,5229,75961,715492,11137824,135224164
%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).
%C a(8) requires more than 10^9 digits of Pi. - _Michael S. Branicky_, Jul 08 2021
%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
%o (Python) # uses function in A076106
%o print([A076106_A076130(n)[1] for n in range(1, 6)]) # _Michael S. Branicky_, Jul 08 2021
%Y Cf. A000796, A047658, A076094, A076129, A076106.
%K nonn,base,more
%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
%E a(7) from _Michael S. Branicky_, Jul 08 2021
|