The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093116 Number of partitions of n^2 into squares not less than n. 5
 1, 1, 1, 1, 2, 2, 2, 1, 2, 5, 4, 4, 5, 9, 15, 23, 24, 13, 20, 32, 55, 84, 113, 185, 303, 545, 167, 298, 435, 716, 1055, 1701, 2584, 4213, 6471, 10218, 15884, 4856, 7376, 11231, 17221, 26054, 39583, 60109, 91622, 138569, 209951, 318368, 483098, 730183 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..250 EXAMPLE n=10: 10^2 = 100 = 64+36 = 36+16+16+16+16 = 25+25+25+25, all other partitions of 100 into squares contain parts < 10, therefore a(10) = 4. MAPLE b:= proc(n, i) option remember; `if`(n=0, 1,      `if`(i^2>n, 0, b(n, i+1) +b(n-i^2, i)))     end: a:= proc(n) local r; r:= isqrt(n);       b(n^2, r+`if`(r^2n, 0, b[n, i+1] + b[n-i^2, i]]]; a[n_] := With[{r = Sqrt[n]//Floor}, b[n^2, r + If[r^2

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 21:52 EDT 2020. Contains 334671 sequences. (Running on oeis4.)