OFFSET
0,3
COMMENTS
Every positive integer is a sum of at most four distinct quarter squares, of which the least term is the trace; see A257019.
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..1000
EXAMPLE
Quarter-square representations:
r(0) = 0, so a(0) = 0
r(1) = 1, so a(1) = 1
r(2) = 2, so a(2) = 2
r(3) = 2 + 1, so a(3) = 1
MATHEMATICA
z = 100; b[n_] := Floor[(n + 1)^2/4]; bb = Table[b[n], {n, 0, 100}];
s[n_] := Table[b[n], {k, b[n + 1] - b[n]}];
h[1] = {1}; h[n_] := Join[h[n - 1], s[n]];
g = h[200]; r[0] = {0};
r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, r[n - g[[n]]]]];
Table[Last[r[n]], {n, 0, 3 z}] (* A257022 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 15 2015
STATUS
approved