id:A128954 - OEIS Search Results

Search: id:A128954

Displaying 1-1 of 1 results found.

page 1

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.

+0
1

50, 495, 4952, 49524, 495238, 4952381, 49523810, 495238095, 4952380952, 49523809524, 495238095238, 4952380952381, 49523809523810, 495238095238095, 4952380952380952, 49523809523809524, 495238095238095238 (list; graph; listen)

	OFFSET	`2,1`
	LINKS	`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);`
	CROSSREFS	`Cf. A092695.` `Sequence in context: A111341 A019561 A164757 this_sequence A022147 A160336 A156965` `Adjacent sequences: A128951 A128952 A128953 this_sequence A128955 A128956 A128957`
	KEYWORD	`nonn`
	AUTHOR	`Milan R. Janjic (agnus(AT)blic.net), Apr 28 2007`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research