id:A128959 - OEIS Search Results

Search: id:A128959

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 at least one of the primes 2,3 and is not divible by at least one of the primes 5,7.

+0
1

82, 810, 8096, 80953, 809524, 8095239, 80952382, 809523810, 8095238096, 80952380953, 809523809524, 8095238095239, 80952380952382, 809523809523810, 8095238095238096, 80952380952380953, 809523809523809524 (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/6)-floor(10^n/35)+floor(10^n/210)`
	EXAMPLE	`a(6)=809524`
	MAPLE	`f := n->10^n-floor(10^n/2)-floor(10^n/35)+floor(10^n/210);`
	CROSSREFS	`Cf. A092695.` `Sequence in context: A082972 A031422 A002309 this_sequence A083386 A093282 A085439` `Adjacent sequences: A128956 A128957 A128958 this_sequence A128960 A128961 A128962`
	KEYWORD	`nonn`
	AUTHOR	`Milan R. Janjic (agnus(AT)blic.net), Apr 28 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research