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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128952 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 the prime 3 and is not divisible by at least one of the primes 2, 5 and 7. 1
66, 657, 6572, 65715, 657143, 6571429, 65714286, 657142857, 6571428572, 65714285715, 657142857143, 6571428571429, 65714285714286, 657142857142857, 6571428571428572, 65714285714285715, 657142857142857143 (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

a(n) = 10^n-floor(10^n/3)-floor(10^n/70)+floor(10^n/210)

EXAMPLE

a(6) = 657143.

MAPLE

a := n->10^n-floor(10^n/3)-floor(10^n/70)+floor(10^n/210);

PROG

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

CROSSREFS

Cf. A092695.

Sequence in context: A175260 A129218 A046409 * A101093 A056468 A027785

Adjacent sequences:  A128949 A128950 A128951 * A128953 A128954 A128955

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 16 21:30 EST 2012. Contains 205971 sequences.