The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085252 Number of ways to write n as sum of two powerful numbers (A001694). 6
 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; text; 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: A061007 A060838 A206567 * A250214 A073423 A219180 Adjacent sequences:  A085249 A085250 A085251 * A085253 A085254 A085255 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jun 23 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 12:18 EST 2020. Contains 330958 sequences. (Running on oeis4.)