sum-of-(non-zero)-squares representations versus partitions into squares

[franktaw at netscape.net]

 Yes; it's really quite simple.  Your sequence is the number of parititions of n into numbers of the form k^2-1.
 
Franklin T. Adams-Watters
16 W. Michigan Ave.
Palatine, IL 60067
847-776-7645
 
 
-----Original Message-----
From: wouter meeussen <wouter.meeussen at pandora.be>
To: Seqfan (E-mail) <seqfan at ext.jussieu.fr>
Sent: Sun, 16 Oct 2005 18:35:56 +0200
Subject: sum-of-(non-zero)-squares representations versus partitions into squares


Hi all,
here's a sketch that might yield to analysis:
consider the count of sum-of-(non-zero)-squares representation of n=64 in k 
terms:
k=64: 1 :: {1,1, ..,1} : the all-ones case
k=63: 0 :: nill
k=62: 0 :: nill
k=61: 1 :: {4,1,1,..,1}
k=60: 0
etc.

Now, it turns out that for n sufficiently big, the count for k downwards from n 
to 1 always goes:
{1,0,0,1,0,0,1,0,1,1,0,1,1,0,1,2,1,1,2,1,1,2,1,2,4,1,2,4,1,2,5,
2,4,5,2,5,5,2,6,7,4,6,7,5,6,8,6,8,12,6,9,13,6,..
where the last integers are in doubt, 'cause slowly converging to a limiting 
value.
It would be good to pin down the length of the 'fully converged' part. Not done 
yet.

It also seems evident that there must be a link to the partitions into 
squares.(A001156)
1,1,1,1,2,2,2,2,3,4,4,4,5,6,6,6,8,9,10,10,12,13,14,14,16,19 ..
but I don't see it straight away. Anyone care to enlighten me?

W.
__________________________________________________________________
Look What The New Netscape.com Can Do!
Now you can preview dozens of stories and have the ones you select delivered to you without ever leaving the Top Home Page. And the new Tool Box gives you one click access to local Movie times, Maps, White Pages and more.  See for yourself at http://netcenter.netscape.com/netcenter/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20051017/59bf7901/attachment-0001.htm>