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 A037060 #18 Jul 21 2025 00:22:20
%S A037060 1,13,86,603,4620,37299,1533327,22568442,23574105,210014510,
%T A037060 1893613727,17241353173,493582559244,13474975578701,71056054875827,
%U A037060 1180956491651370,10728352138939963,103710009988272649,960912626678471376,1005142876338508545,50686811139876408310,288867303325879381560
%N A037060 a(n)-th prime is the smallest prime containing exactly n 4's.
%H A037060 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037060 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037060 a(n) = A000720(A037061(n)). - _Amiram Eldar_, Jul 20 2025
%t A037060 (* see A037061 for f *) PrimePi[ Table[ f[n, 4], {n, 1, 12}]]
%Y A037060 Cf. A000720, A037061, A034388.
%Y A037060 Cf. A037052, A037054, A037056, A037058, A037062, A037064, A037066, A037068, A037070.
%K A037060 nonn,base,hard
%O A037060 0,2
%A A037060 _Patrick De Geest_, Jan 04 1999
%E A037060 a(0)=1 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037060 a(13)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 20 2025