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 A037068 #19 Jul 21 2025 06:10:47
%S A037068 1,23,152,1107,8611,70478,1793210,5156463,45470645,2074530409,
%T A037068 11397691034,33578243459,1603686087003,2859644709998,26622184513952,
%U A037068 518238694402971,2339285051888769,69641948074252447,208626752630607267,8383527978057824838,119921750787289924042,375732914981870085595
%N A037068 a(n)-th prime is the smallest prime containing exactly n 8's.
%H A037068 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037068 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037068 a(n) = A000720(A037069(n)). - _Amiram Eldar_, Jul 21 2025
%t A037068 (* see A037069 for f *) PrimePi[ Table[ f[n, 8], {n, 1, 13}]]
%Y A037068 Cf. A000720, A037069, A034388.
%Y A037068 Cf. A037052, A037054, A037056, A037058, A037060, A037062, A037064, A037066, A037070.
%K A037068 nonn,base,hard
%O A037068 0,2
%A A037068 _Patrick De Geest_, Jan 04 1999
%E A037068 a(0)=1 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037068 a(12) corrected and a(13)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 21 2025