login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091636 Number of primes less than 10^n which do not contain the digit 2. 11
3, 22, 139, 877, 6235, 46105, 352155, 2747284, 21831323, 175881412, 1432781905, 11778245565 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

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

EXAMPLE

a(2) = 22 because of the 25 primes less than 10^2, 3 have at least one digit 2. 25-3 = 22.

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], 2] == {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (from Robert G. Wilson v Feb 02 2004)

CROSSREFS

a(n) + A091636(n) = A006880(n).

Cf. A091634, A091635, A091637, A091638, A091639, A091640, A091641, A091642, A091643.

Sequence in context: A100511 A033506 A091639 * A156089 A110469 A121723

Adjacent sequences:  A091633 A091634 A091635 * A091637 A091638 A091639

KEYWORD

more,nonn,base

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Jan 30 2004

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 02 2004

a(9)-a(12) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 14 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:57 EST 2012. Contains 206009 sequences.