id:A095683 - OEIS Search Results

Search: id:A095683

Displaying 1-1 of 1 results found.

page 1

Number of prime power divisors of n. If n=product p_i^r_i then d=product {p_i^s_i, 2<=s_i<=r_i, s_i is prime} is a prime power divisor of n.

+0
2

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

	OFFSET	`1,8`
	FORMULA	`Multiplicative with a(p^e) = A000720(e). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 06 2004`
	EXAMPLE	`n=16: prime power divisors of 16 are {2^2, 2^3}, so a(16)=2.`
	CROSSREFS	`Sequence in context: A124749 A127844 A017877 this_sequence A074079 A037858 A037876` `Adjacent sequences: A095680 A095681 A095682 this_sequence A095684 A095685 A095686`
	KEYWORD	`nonn,mult`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 06 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research