id:A085252 - OEIS Search Results

Search: id:A085252

Displaying 1-1 of 1 results found.

page 1

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

+0
7

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; listen)

	OFFSET	`1,17`
	COMMENT	`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	`Adjacent sequences: A085249 A085250 A085251 this_sequence A085253 A085254 A085255` `Sequence in context: A116852 A060154 A061007 this_sequence A073423 A134023 A015738`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 23 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research