Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091635
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A091635
%S A091635 4,17,101,670,4675,34425,262549,2051466,16312743,131464721,1071368863,
%T A091635 8809580516
%N A091635 Number of primes less than 10^n which do not contain the digit 1.
%F A091635 Number of primes less than 10^n after removing any primes with at least 
               one digit 1.
%e A091635 a(2) = 17 because of the 25 primes less than 10^2, 8 have at least one 
               digit 1; 25-8 = 17.
%t A091635 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)
%Y A091635 a(n) + A091645(n) = A006880(n).
%Y A091635 Cf. A091634, A091636, A091637, A091638, A091639, A091640, A091641, A091642, 
               A091643.
%Y A091635 Sequence in context: A123750 A024052 A128321 this_sequence A127676 A122940 
               A077386
%Y A091635 Adjacent sequences: A091632 A091633 A091634 this_sequence A091636 A091637 
               A091638
%K A091635 more,nonn,base
%O A091635 1,1
%A A091635 Enoch Haga (Enokh(AT)comcast.net), Jan 30 2004
%E A091635 Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 02 
               2004
%E A091635 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research