id:A056170 - OEIS Search Results

Search: id:A056170

Displaying 1-1 of 1 results found.

page 1

Number of non-unitary prime divisors of n.

+0
14

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

	OFFSET	`1,36`
	COMMENT	`Number of prime squares dividing n. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 18 2002`
	FORMULA	`A prime factor of n is not unitary iff its exponent is p in prime factorization of n. In general GCD[p, n/p]=1 or =p` `Additive with a(p^e) = 0 if e = 1, 1 otherwise.`
	CROSSREFS	`A034444, A001221.` `Cf. A057427(a(n)) = 1 - A008966(n).` `Sequence in context: A093956 A160383 A101436 this_sequence A059483 A067618 A055029` `Adjacent sequences: A056167 A056168 A056169 this_sequence A056171 A056172 A056173`
	KEYWORD	`nice,nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 27 2000`

page 1

Search completed in 0.005 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research