id:A089723 - OEIS Search Results

Search: id:A089723

Displaying 1-1 of 1 results found.

page 1

a(1)=1, for n>1; a(n) gives number of ways to write n as n = x^y, 2 <= x, 1 <= y.

+0
1

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

	OFFSET	`1,4`
	COMMENT	`This function depends only on the prime signature of n. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 10 2006`
	FORMULA	`If n = Product p_i^e_i, a(n) = d(gcd(<e_i>)). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 10 2006`
	EXAMPLE	`144 = 2^4 * 3^2, gcd(4,2) = 2, d(2) = 2, so a(144) = 2. The representations are 144^1 and 12^2.`
	CROSSREFS	`Cf. A000005.` `Sequence in context: A122377 A037827 A086074 this_sequence A055215 A058398 A091499` `Adjacent sequences: A089720 A089721 A089722 this_sequence A089724 A089725 A089726`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (pcmusume(AT)m11.alpha-net.ne.jp), Jan 07 2004`

page 1

Search completed in 0.002 seconds

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.

AT&T Labs Research