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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091645 Number of primes less than 10^n having at least one digit 1. 3
0, 8, 67, 559, 4917, 44073, 402030, 3709989, 34534791, 323587790, 3046685950, 28798331502 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

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

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

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) + A091635(n) = A006880(n).

Cf. A091645, A091646, A091647, A091705, A091706, A091707, A091708, A091709, A091710.

Sequence in context: A196453 A037594 A037685 * A015574 A152055 A000434

Adjacent sequences:  A091642 A091643 A091644 * A091646 A091647 A091648

KEYWORD

more,nonn,base

AUTHOR

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

EXTENSIONS

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

3 more terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 20 2005

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 15 12:10 EST 2012. Contains 205783 sequences.