A061704 - OEIS

This site is supported by donations to The OEIS Foundation.

A061704

Number of cubes dividing n.

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,8`
	COMMENTS	`Multiplicative with a(p^e) = [e/3]+1. - Mitch Harris, Apr 19 2005.`
	FORMULA	`G.f.: sum(n>=1, x^(n^3)/(1-x^(n^3)) ) - Joerg Arndt, Jan 30 2011` `a(n) =A000005(A053150(n))` `Multiplicative with a(p^e) = [e/3]+1.`
	EXAMPLE	`a(128)=4 since 128 is divisible by 1^3=1, 2^3=8 and 4^3=64.`
	CROSSREFS	`Cf. A046951.` `Sequence in context: A136713 A198293 A043281 * A050361 A072911 A053150` `Adjacent sequences: A061701 A061702 A061703 * A061705 A061706 A061707`
	KEYWORD	`nonn,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 18 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.