cp's OEIS Frontend

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.

A276473 Number of terms of A202259 with precisely n digits.

Original entry on oeis.org

6, 38, 320, 2819, 25668, 237586, 2224574, 21007948, 199725336, 1908845614, 18321586810, 176478166845
Offset: 1

Views

Author

Barry Carter, Sep 12 2016

Keywords

Comments

When generating n random digits in order, number of ways to fail to generate a prime at any step.
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

Crossrefs

Cf. A202259.

Extensions

a(9)-a(11) from Michael S. Branicky, Nov 13 2024
a(12) from Michael S. Branicky, Nov 18 2024