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.

A091641 Number of primes less than 10^n which do not contain the digit 7.

Original entry on oeis.org

3, 16, 100, 680, 4773, 34992, 266823, 2079512, 16503238, 132852644, 1081509855, 8885472675, 73563855306, 612982476612
Offset: 1

Views

Author

Enoch Haga, Jan 30 2004

Keywords

Comments

Number of primes less than 10^n after removing any primes with at least one digit 7.

Examples

			a(2) = 16 because of the 25 primes less than 10^2, 9 have at least one digit 7; 25-9=16.
		

Crossrefs

Programs

  • Mathematica
    NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; c = 0; p = 1; Do[ While[ p = NextPrim[p]; p < 10^n, If[ Position[ IntegerDigits[p], 7] == {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* Robert G. Wilson v, Feb 02 2004 *)
  • Python
    from sympy import primerange
    def a(n): return sum('7' not in str(p) for p in primerange(2, 10**n))
    print([a(n) for n in range(1, 7)]) # Michael S. Branicky, Mar 16 2021

Formula

a(n) = A006880(n) - A091708(n).

Extensions

Edited and extended by Robert G. Wilson v, Feb 02 2004
a(9)-a(12) from Donovan Johnson, Feb 14 2008
a(13) from Robert Price, Nov 08 2013
a(14) from Giovanni Resta, Mar 20 2017