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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091635 Number of primes less than 10^n which do not contain the digit 1. 10

%I

%S 4,17,101,670,4675,34425,262549,2051466,16312743,131464721,1071368863,

%T 8809580516,72986908554,608542410004

%N Number of primes less than 10^n which do not contain the digit 1.

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

%F a(n) = A006880(n) - A091645(n).

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

%t 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}] (* _Robert G. Wilson v_, Feb 02 2004 *)

%Y Cf. A091634, A091636, A091637, A091638, A091639, A091640, A091641, A091642, A091643.

%K more,nonn,base

%O 1,1

%A _Enoch Haga_, Jan 30 2004

%E Edited and extended by _Robert G. Wilson v_, Feb 02 2004

%E a(9)-a(12) from _Donovan Johnson_, Feb 14 2008

%E a(13) from _Robert Price_, Nov 08 2013

%E a(14) from _Giovanni Resta_, Mar 20 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 09:05 EST 2019. Contains 329995 sequences. (Running on oeis4.)