This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A076130 #23 Aug 22 2021 00:14:10 %S A076130 13,299,5229,75961,715492,11137824,135224164 %N 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). %C A076130 a(8) requires more than 10^9 digits of Pi. - _Michael S. Branicky_, Jul 08 2021 %H A076130 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 A076130 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 A076130 (Python) # uses function in A076106 %o A076130 print([A076106_A076130(n)[1] for n in range(1, 6)]) # _Michael S. Branicky_, Jul 08 2021 %Y A076130 Cf. A000796, A047658, A076094, A076129, A076106. %K A076130 nonn,base,more %O A076130 1,1 %A A076130 Jean-Christophe Colin (jc-colin(AT)wanadoo.fr), Oct 31 2002 %E A076130 Edited by _Charles R Greathouse IV_, Aug 02 2010 %E A076130 Definition clarified by _N. J. A. Sloane_, Nov 28 2019 %E A076130 a(7) from _Michael S. Branicky_, Jul 08 2021