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 A037058 #18 Jul 21 2025 00:22:07
%S A037058 1,2,51,345,2602,27062,232466,1935248,17950160,155123231,1022275037,
%T A037058 13076476440,119921146473,1100928006234,9986615648246,39453679683959,
%U A037058 636484070277727,8477216022186037,80079195779613271,758351887226957873,7209429409009441899,68676498683402943115
%N A037058 a(n)-th prime is the smallest prime containing exactly n 3's.
%H A037058 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037058 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037058 a(n) = A000720(A037059(n)). - _Amiram Eldar_, Jul 20 2025
%t A037058 (* see A037059 for f *) PrimePi[ Table[ f[n, 3], {n, 1, 13}]]
%Y A037058 Cf. A000720, A037059, A034388.
%Y A037058 Cf. A037052, A037054, A037056, A037060, A037062, A037064, A037066, A037068, A037070.
%K A037058 nonn,base,hard
%O A037058 0,2
%A A037058 _Patrick De Geest_, Jan 04 1999
%E A037058 Edited and extended by _Robert G. Wilson v_, Jul 04 2003
%E A037058 a(0)=1 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037058 a(14)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 20 2025