Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091637 Number of primes less than 10^n which do not contain the digit 3. +0
11
3, 16, 102, 668, 4715, 34813, 265015, 2067152, 16413535, 132200223, 1076692515, 8849480283 (list; graph; listen)
OFFSET

1,1

FORMULA

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

EXAMPLE

a(2)=16 because there are 25 primes less than 10^2, 9 have at least one digit 3; 25-9 = 16.

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

CROSSREFS

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

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

Sequence in context: A009151 A009007 A000949 this_sequence A074542 A105622 A110903

Adjacent sequences: A091634 A091635 A091636 this_sequence A091638 A091639 A091640

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research