cp's OEIS Frontend

A257020 Numbers whose quarter-square representation consists of three terms.

%I A257020 #4 Apr 15 2015 15:42:47
%S A257020 15,19,23,28,33,35,39,41,45,47,52,54,59,61,63,67,69,71,75,77,79,80,84,
%T A257020 86,88,89,93,95,97,98,103,105,107,108,113,115,117,118,120,124,126,128,
%U A257020 129,131,135,137,139,140,142,143,147,149,151,152,154,155,159,161
%N A257020 Numbers whose quarter-square representation consists of three terms.
%C A257020 Every positive integer is a sum of at most four distinct quarter squares (see A257019).
%H A257020 Clark Kimberling, <a href="/A257020/b257020.txt">Table of n, a(n) for n = 1..1000</a>
%e A257020 Quarter-square representations:
%e A257020 r(15) = 12 + 2 + 1, three terms; a(1) = 15
%e A257020 r(19) = 16 + 2 + 1, three terms; a(2) = 19
%t A257020 z = 100; b[n_] := Floor[(n + 1)^2/4]; bb = Table[b[n], {n, 0, 100}];
%t A257020 s[n_] := Table[b[n], {k, b[n + 1] - b[n]}];
%t A257020 h[1] = {1}; h[n_] := Join[h[n - 1], s[n]];
%t A257020 g = h[100]; r[0] = {0};
%t A257020 r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, r[n - g[[n]]]]];
%t A257020 u = Table[Length[r[n]], {n, 0, 4 z}];(* A257023 *)
%t A257020 Flatten[-1 + Position[u, 1]]; (* A002620 *)
%t A257020 Flatten[-1 + Position[u, 2]]; (* A257019 *)
%t A257020 Flatten[-1 + Position[u, 3]]; (* A257020 *)
%t A257020 Flatten[-1 + Position[u, 4]]; (* A257021 *)
%Y A257020 Cf. A002620, A257019, A257021, A257023 (trace), A257024 (number of square in quarter-square representation).
%K A257020 nonn,easy
%O A257020 1,1
%A A257020 _Clark Kimberling_, Apr 15 2015