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 A037062 #17 Jul 21 2025 00:22:25
%S A037062 1,3,102,733,14319,45741,1004275,3313338,169807396,259770566,
%T A037062 20255937351,21366409911,196256438549,10949682060338,16876678891444,
%U A037062 1376534319069676,13702579963679833,13947379867469643,360360819534753751,3421022095727840569,93257415087729395138,113268191247939457737
%N A037062 a(n)-th prime is the smallest prime containing exactly n 5's.
%H A037062 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037062 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037062 a(n) = A000720(A037063(n)). - _Amiram Eldar_, Jul 20 2025
%t A037062 (* see A037063 for f *) PrimePi[ Table[ f[n, 5], {n, 1, 12}]]
%Y A037062 Cf. A000720, A037063, A034388.
%Y A037062 Cf. A037052, A037054, A037056, A037058, A037060, A037064, A037066, A037068, A037070.
%K A037062 nonn,base,hard
%O A037062 0,2
%A A037062 _Patrick De Geest_, Jan 04 1999
%E A037062 a(0)=1 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037062 a(13)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 20 2025