The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. 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; text; 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) = 10^6 - floor(10^6/3) - floor(10^6/70) + floor(10^6/210) = 1000000 - floor(333333.333...) - floor(14285.714...) + floor(4761.904...) = 1000000 - 333333 - 14285 + 4761 = 657143. - Jon E. Schoenfield, Nov 18 2018 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: A233065 A129218 A046409 * A282050 A270258 A223410 Adjacent sequences:  A128949 A128950 A128951 * A128953 A128954 A128955 KEYWORD nonn AUTHOR Milan Janjic, Apr 28 2007 STATUS approved

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.

Last modified February 21 05:23 EST 2020. Contains 332086 sequences. (Running on oeis4.)