A085252 - OEIS

This site is supported by donations to The OEIS Foundation.

A085252

Number of ways to write n as sum of two powerful numbers (A001694).

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

	OFFSET	`1,17`
	COMMENTS	`a(A085253(n))=0; a(A076871(n))>0; a(A085254(n))=1; a(A085255(n))>1.`
	LINKS	`Eric Weisstein's World of Mathematics, Powerful Number`
	EXAMPLE	`a(81)=2: 81 = 9+72=A001694(4)+A001694(12) =` `32+49=A001694(8)+A001694(10).`
	CROSSREFS	`Sequence in context: A060154 A061007 A206567 * A073423 A179952 A134023` `Adjacent sequences: A085249 A085250 A085251 * A085253 A085254 A085255`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 23 2003`

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

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.