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.

A231792 Count of the first 10^n primes containing at least one 5's digit.

Original entry on oeis.org

1, 15, 292, 3365, 39360, 464466, 5262871, 56702805, 607358478, 6463119473, 68932485429
Offset: 1

Views

Author

Robert Price, Nov 13 2013

Keywords

Examples

			a(2)=15 because there are 15 primes not greater than 541 (the 100th prime) that contain a 5's digit.  Namely: 5, 53 59, 151, 157, 251, 257,  353, 359, 457, 503, 509, 521, 523, 541.
		

Crossrefs

Programs

  • Mathematica
    cnt = 0; Table[Do[p = Prime[k]; If[MemberQ[IntegerDigits[p], 5], cnt++], {k, 10^(n - 1) + 1, 10^n}]; cnt, {n, 5}] (* T. D. Noe, Nov 13 2013 *)

Formula

a(n) ~ 10^n. - Charles R Greathouse IV, May 21 2014