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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128959 a(n) is equal to the number of positive integers m less than or equal to 10^n such that m is not divisible by at least one of the primes 2,3 and is not divible by at least one of the primes 5,7. 1
82, 810, 8096, 80953, 809524, 8095239, 80952382, 809523810, 8095238096, 80952380953, 809523809524, 8095238095239, 80952380952382, 809523809523810, 8095238095238096, 80952380952380953, 809523809523809524 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 2..1000

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

f(n)= 10^n-floor(10^n/6)-floor(10^n/35)+floor(10^n/210)

EXAMPLE

a(6)=809524

MAPLE

f := n->10^n-floor(10^n/2)-floor(10^n/35)+floor(10^n/210);

PROG

(MAGMA) [10^n-Floor(10^n/6)-Floor(10^n/35)+Floor(10^n/210): n in [2..20]]; // Vincenzo Librandi, Oct 02 2011

CROSSREFS

Cf. A092695.

Sequence in context: A031422 A186688 A002309 * A173356 A083386 A160154

Adjacent sequences:  A128956 A128957 A128958 * A128960 A128961 A128962

KEYWORD

nonn

AUTHOR

Milan R. Janjic (agnus(AT)blic.net), Apr 28 2007

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 23:21 EST 2012. Contains 205860 sequences.