login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A025425
Number of partitions of n into 10 squares.
5
1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 3, 4, 5, 4, 4, 6, 6, 7, 6, 7, 8, 8, 7, 9, 11, 10, 10, 11, 12, 12, 12, 13, 15, 16, 13, 17, 18, 17, 17, 20, 20, 21, 20, 20, 25, 23, 22, 25, 27, 27, 26, 29, 30, 33, 31, 32, 36, 37, 33, 35, 40, 38, 40, 41, 42, 46, 43, 44, 49, 50, 47, 54, 54, 54, 54, 55, 58, 60, 61
OFFSET
0,5
LINKS
MAPLE
b:= proc(n, i, t) option remember; `if`(n=0, 1,
`if`(i<1 or t<1, 0, b(n, i-1, t)+
`if`(i^2>n, 0, b(n-i^2, i, t-1))))
end:
a:= n-> b(n, isqrt(n), 10):
seq(a(n), n=0..120); # Alois P. Heinz, May 30 2014
MATHEMATICA
a[n_] := PowersRepresentations[n, 10, 2] // Length; Array[a, 120, 0] (* Jean-François Alcover, Feb 19 2016 *)
CROSSREFS
Cf. A001156.
Sequence in context: A187821 A114775 A071136 * A234451 A085501 A069623
KEYWORD
nonn
STATUS
approved