[seqfan] Re: Number of ways to write n^2 as the sum of n odd numbers

[franktaw at netscape.net]

The number of partitions of n into k odd parts is equal to the number 
of partitions of (n+k)/2 into k parts; or equivalently the number of 
partitions of (n-k)/2 into at most k parts.

Franklin T. Adams-Watters

-----Original Message-----
From: Richard Mathar <mathar at strw.leidenuniv.nl>

An even more fundamental question is whether the table of the number
of partitions of n into k odd parts ...