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 A037064 #20 Jul 21 2025 00:22:29
%S A037064 1,18,121,859,15226,54070,1071206,3933314,34614430,309084622,
%T A037064 2792083255,61496476037,1214237371612,5255429125063,105341326636887,
%U A037064 458846460486827,15441107727480784,16660543186177748,832868428561305574,1494006786965549890,14206605445888164436,135418222271099812357
%N A037064 a(n)-th prime is the smallest prime containing exactly n 6's.
%H A037064 Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.
%H A037064 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">primecount</a>, Fast prime counting function library.
%F A037064 a(n) = A000720(A037065(n)). - _Amiram Eldar_, Jul 20 2025
%t A037064 (* see A037065 for f *) PrimePi[ Table[ f[n, 6], {n, 1, 12}]]
%Y A037064 Cf. A000720, A037065, A034388.
%Y A037064 Cf. A037052, A037054, A037056, A037058, A037060, A037062, A037066, A037068, A037070.
%K A037064 nonn,base,hard
%O A037064 0,2
%A A037064 _Patrick De Geest_, Jan 04 1999
%E A037064 One more terms from _Hans Havermann_, Jun 16 2001
%E A037064 a(0)=1 prepended by _Sean A. Irvine_, Dec 06 2020
%E A037064 a(13)-a(21) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Jul 20 2025