login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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
13, 299, 5229, 75961, 715492, 11137824, 135224164 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

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

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

EXAMPLE

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

PROG

(Python) # uses function in A076106

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

CROSSREFS

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

Sequence in context: A023357 A165218 A317632 * A035272 A296319 A009119

Adjacent sequences:  A076127 A076128 A076129 * A076131 A076132 A076133

KEYWORD

nonn,base,more

AUTHOR

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

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

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 04:24 EDT 2021. Contains 347698 sequences. (Running on oeis4.)