|
|
A241835
|
|
Numbers k such that k^2 is s-greedy summable, where s is the sequence A000290 of squares.
|
|
4
|
|
|
5, 7, 9, 11, 13, 15, 18, 19, 21, 23, 25, 27, 30, 32, 33, 35, 37, 39, 41, 43, 46, 48, 49, 51, 53, 55, 57, 59, 61, 63, 66, 68, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 90, 92, 93, 95, 98, 99, 101, 103, 105, 107, 109, 111, 113, 115, 118, 120, 121, 123, 126, 128
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Greedy residue sums are introduced at A241833.
|
|
LINKS
|
|
|
EXAMPLE
|
5^2 = 4^2 + 3^2; 7^2 = 6^2 + 3^2 + 3^2; 9^2 = 8^2 + 4^2 + 1^2.
|
|
MATHEMATICA
|
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 *)
c = Table[Length[t[[n]][[2]]], {n, 2, z}] (* A241834 *)
f = 1 + Flatten[Position[tr, 0]] (* A241835 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|