id:A128952 - OEIS Search Results

Search: id:A128952

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

+0
1

66, 657, 6572, 65715, 657143, 6571429, 65714286, 657142857, 6571428572, 65714285715, 657142857143, 6571428571429, 65714285714286, 657142857142857, 6571428571428572, 65714285714285715, 657142857142857143 (list; graph; listen)

	OFFSET	`2,1`
	LINKS	`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) = 657143.`
	MAPLE	`a := n->10^n-floor(10^n/3)-floor(10^n/70)+floor(10^n/210);`
	CROSSREFS	`Cf. A092695.` `Sequence in context: A106212 A129218 A046409 this_sequence A101093 A056468 A027785` `Adjacent sequences: A128949 A128950 A128951 this_sequence A128953 A128954 A128955`
	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