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 A037056 #18 Jul 21 2025 00:21:56
%S A037056 2,1,48,331,2490,94500,1283805,1402294,12238270,891573671,975688072,
%T A037056 77612456753,715763987889,748327378591,6944174236934,580400102242316,
%U A037056 5209104353769836,5710407472211223,510579443617388387,4806424039483242581,45763276831811185976,440594267900327752100
%N A037056 a(n)-th prime is the smallest prime containing exactly n 2's.
%H A037056 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037056 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037056 a(n) = A000720(A037057(n)). - _Amiram Eldar_, Jul 20 2025
%t A037056 (* see A037057 for f *) PrimePi[ Table[ f[n, 2], {n, 1, 13}]]
%Y A037056 Cf. A000720, A037057, A034388.
%Y A037056 Cf. A037052, A037054, A037058, A037060, A037062, A037064, A037066, A037068, A037070.
%K A037056 nonn,base,hard
%O A037056 0,1
%A A037056 _Patrick De Geest_, Jan 04 1999
%E A037056 a(0)=2 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037056 a(14)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 20 2025