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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128954 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 2 and is not divisible by at least one of the primes 3, 5 and 7. 1
50, 495, 4952, 49524, 495238, 4952381, 49523810, 495238095, 4952380952, 49523809524, 495238095238, 4952380952381, 49523809523810, 495238095238095, 4952380952380952, 49523809523809524, 495238095238095238 (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/2)-floor(10^n/105)+floor(10^n/210)

EXAMPLE

a(6)=495238

MAPLE

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

PROG

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

CROSSREFS

Cf. A092695.

Sequence in context: A019561 A164757 A189415 * A022147 A187669 A160336

Adjacent sequences:  A128951 A128952 A128953 * A128955 A128956 A128957

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 18 00:14 EST 2012. Contains 206085 sequences.