Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Jan 05 2025 12:31:33
%S 0,0,0,1,4,11,21,37,59,88,125,172,228,296,376,469,576,699,837,993,
%T 1167,1360,1573,1808,2064,2344,2648,2977,3332,3715,4125,4565,5035,
%U 5536,6069,6636,7236,7872,8544,9253,10000,10787,11613,12481,13391
%N Number of (w,x,y,z) with all terms in {1,...,n} and w=x+2y+3z-n.
%C For a guide to related sequences, see A211795.
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1,-1,0,2,-1).
%F a(n) = 2*a(n-1)-a(n-3)-a(n-4)+2*a(n-6)-a(n-7).
%F G.f.: x^3*(3*x^2+2*x+1)/((x-1)^4*(x+1)*(x^2+x+1)). - _Colin Barker_, Oct 07 2012
%t t = Compile[{{n, _Integer}}, Module[{s = 0},
%t (Do[If[w == x + 2 y + 3 z - n, s = s + 1],
%t {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
%t Map[t[#] &, Range[0, 40]] (* A212254 *)
%t (* _Peter J. C. Moses_, Apr 13 2012 *)
%Y Cf. A211795.
%K nonn,easy
%O 0,5
%A _Clark Kimberling_, May 15 2012