|
%I #4 May 09 2014 17:41:35
%S 25,49,81,121,169,225,324,361,441,529,625,729,900,1024,1089,1225,1369,
%T 1521,1681,1849,2116,2304,2401,2601,2809,3025,3249,3481,3721,3969,
%U 4356,4624,4761,5041,5329,5625,5929,6241,6561,6889,7225,7569,8100,8464,8649,9025
%N Squares-greedy summable squares.
%C Greedy summability is introduced at A241833.
%H Clark Kimberling, <a href="/A241836/b241836.txt">Table of n, a(n) for n = 2..1000</a>
%e 5^2 = 4^2 + 3^2; 7^2 = 6^2 + 3^2 + 3^2; 9^2 = 8^2 + 4^2 + 1^2.
%t z = 200; s = Table[n^2, {n, 1, z}]; t = Table[{s[[n]], #, Total[#] == s[[n]]} &[DeleteCases[-Differences[FoldList[If[#1 - #2 >= 0, #1 - #2, #1] &, s[[n]], Reverse[Select[s, # < s[[n]] &]]]], 0]], {n, z}]; r[n_] := s[[n]] - Total[t[[n]][[2]]]; tr = Table[r[n], {n, 2, z}] (* A241833 *)
%t c = Table[Length[t[[n]][[2]]], {n, 2, z}] (* A241834 *)
%t f = 1 + Flatten[Position[tr, 0]] (* A241835 *)
%t f^2 (* A241836 *) (* _Peter J. C. Moses_, May 06 2014 *)
%Y Cf. A241832, A241835, A241835, A000290.
%K nonn,easy
%O 2,1
%A _Clark Kimberling_, May 09 2014
|
