id:A093318 - OEIS Search Results

Search: id:A093318

Displaying 1-1 of 1 results found.

page 1

d(n) = number of positive divisors k of n where mu(k) = 1 and mu(n/k) = -1.

+0
1

0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 4, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 4, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 4, 1, 1, 0, 4, 1, 0, 1, 0, 1, 1, 0, 4, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0 (list; graph; listen)

	OFFSET	`1,30`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	FORMULA	`4d(n) + sum{k\|n} mu(k)mu(n/k) = product{p\|n} e(p, n), where the product is over the distinct primes dividing n; e(p, n) = 2 if p\|n but p^2 does not divide n; e(p, n) = 1 if p^2\|n but p^3 does not divide n; e(p, n) = 0 if p^3\|n.`
	CROSSREFS	`Cf. A008683 (for mu).` `Sequence in context: A013464 A051390 A124120 this_sequence A127560 A098172 A049759` `Adjacent sequences: A093315 A093316 A093317 this_sequence A093319 A093320 A093321`
	KEYWORD	`nonn,easy`
	AUTHOR	`Leroy Quet Apr 26 2004`
	EXTENSIONS	`More terms from Pab Ter (pabrlos(AT)yahoo.com), May 24 2004`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research