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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128950 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 7 and is not divisible by at least one of the primes 2, 3 and 5. 1
83, 829, 8286, 82858, 828571, 8285715, 82857143, 828571429, 8285714286, 82857142858, 828571428571, 8285714285715, 82857142857143, 828571428571429, 8285714285714286, 82857142857142858, 828571428571428571 (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/7)-floor(10^n/30)+floor(10^n/210)

EXAMPLE

a(6)=828571

MAPLE

f := n->10^n-floor(10^n/7)-floor(10^n/30)+floor(10^n/210);

PROG

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

CROSSREFS

Sequence in context: A059935 A069596 A112766 * A068851 A037069 A195893

Adjacent sequences:  A128947 A128948 A128949 * A128951 A128952 A128953

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 14 23:53 EST 2012. Contains 205689 sequences.