|
| |
|
|
A143574
|
|
Sum of all distinct squares occurring when partitioning n into two squares.
|
|
4
| |
|
|
0, 1, 1, 0, 4, 5, 0, 0, 4, 9, 10, 0, 0, 13, 0, 0, 16, 17, 9, 0, 20, 0, 0, 0, 0, 50, 26, 0, 0, 29, 0, 0, 16, 0, 34, 0, 36, 37, 0, 0, 40, 41, 0, 0, 0, 45, 0, 0, 0, 49, 75, 0, 52, 53, 0, 0, 0, 0, 58, 0, 0, 61, 0, 0, 64, 130, 0, 0, 68, 0, 0, 0, 36, 73, 74, 0, 0, 0, 0, 0, 80, 81, 82, 0, 0, 170, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| For n > 0: a(n) = 0 iff A000161(n) = 0: a(A022544(n)) = 0;
A143575 gives numbers m such that a(m) = m.
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 0..10000
|
|
|
FORMULA
| a(n) = SUM(k*A010052(k)*A010052(n-k): 1<=k<=n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 27 2008]
|
|
|
EXAMPLE
| A000161(25)=#{5^2+0^2,4^2+3^2}=2: a(25)=25+0+16+9=50;
A000161(26)=#{5^2+1^2}=1: a(16)=25+1=26;
A000161(49)=#{7^2+0^2}=1: a(49)=49+0=49;
A000161(50)=#{7^2+1^2,5^2+5^2}=2: a(50)=49+1+25=75;
A000161(2600)=#{50^2+10^2,46^2+22^2,38^2+34^2}=3:
a(2600)=2500+100+2116+484+1444+1156=7800;
A000161(2601)=#{51^2+0^2,45^2+24^2}=2:
a(2601)=2601+0+12025+576=5202;
A000161(2602)=#{51^2+1^2}=1: a(26002)=2601+1=2602.
|
|
|
CROSSREFS
| A002654. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 27 2008]
Sequence in context: A024247 A067445 A167003 * A075424 A200619 A199621
Adjacent sequences: A143571 A143572 A143573 * A143575 A143576 A143577
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 24 2008
|
| |
|
|
