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 A276473 #47 Nov 19 2024 10:34:28 %S A276473 6,38,320,2819,25668,237586,2224574,21007948,199725336,1908845614, %T A276473 18321586810,176478166845 %N A276473 Number of terms of A202259 with precisely n digits. %C A276473 When generating n random digits in order, number of ways to fail to generate a prime at any step. %C A276473 a(n+1) >= 6*a(n), for n > 1, since any term of A202259 counted in a(n) may be extended with 0, 2, 4, 5, 6, or 8. - _Michael S. Branicky_, Nov 18 2024 %H A276473 Barry Carter, <a href="https://github.com/barrycarter/bcapps/blob/master/QUORA/bc-primes.m">Mathematica work on probability of generating member of A202259 after generating n random numbers in order</a> %H A276473 Michael S. Branicky, <a href="/A276473/a276473.py.txt">Python program for OEIS A276473</a> %o A276473 (Perl/tcsh) "bzcat A202259.b.txt.bz2 | perl -anle 'print length($F[1])' | sort | uniq -c" with file at https://github.com/barrycarter/bcapps/blob/master/QUORA/A202259.b.txt.bz2 %Y A276473 Cf. A202259. %K A276473 base,hard,more,nonn %O A276473 1,1 %A A276473 _Barry Carter_, Sep 12 2016 %E A276473 a(9)-a(11) from _Michael S. Branicky_, Nov 13 2024 %E A276473 a(12) from _Michael S. Branicky_, Nov 18 2024