[seqfan] Re: Did the OEIS already have the answer to this Math.StackExchange question?

[M. F. Hasler]

PS: Having computed A025429(0..10^4) and found
33, 60, 105, 90, 132, 177, 145, 201, 225, ... =
A080673 = Largest numbers with exactly n representations as sum of
five positive squares.

it is intriguing to look at that graph which suggests some similar
regularity and a lower bound for   A080673 that grows to infinity, but
it appears that

188,259,304,308,372,394,483,497,594,....
are (maybe?) numbers such that there is no n with that number of
representations!
I got these zeros using a few thousand values of A025429, but it seems that:

There is no number <= 10^6 that is the sum of five positive squares in
exactly 188 ways. [Donovan Johnson, Aug 15 2013]

If significant bounds could be given for A025429, then this list of
zeros could be computed without doubts.

Maximilian

On Fri, May 30, 2014 at 3:56 PM, M. F. Hasler <oeis at hasler.fr> wrote:
> On Fri, May 30, 2014 at 2:40 PM, Alonso Del Arte wrote:
>> What is the largest integer with only one representation as a sum of five
>> nonzero squares?
>> http://math.stackexchange.com/questions/811824/
>> This immediately suggests two or three sequences, which might already all
>> be in the OEIS.
>
>
> Sequence A025429 yields the
> Number of partitions of n into 5 nonzero squares.
>
> Your suggested sequences and a link to that stackexchange page could be
> added there.
>
> Maximilian