|
%I #30 Dec 04 2016 08:39:33
%S 0,0,1,5,12,26,45,75,112,164,225,305,396,510,637,791,960,1160,1377,
%T 1629,1900,2210,2541,2915,3312,3756,4225,4745,5292,5894,6525,7215,
%U 7936,8720,9537,10421,11340,12330,13357,14459,15600,16820,18081,19425
%N Number of (w,x,y,z) with all terms in {1,...,n} and w + x = 2y + 2z.
%C Probably related to A199771 and A200252.
%C For a guide to related sequences, see A211795.
%H Colin Barker, <a href="/A212561/b212561.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,1,2,-1).
%F a(n) = 2*a(n-1)+a(n-2)-4*a(n-3)+a(n-4)+2*a(n-5)-a(n-6).
%F a(n) = (2*n^3-2*n^2+n-1-(n-1)*(-1)^n)/8 = (n-1)*(2*n^2+1-(-1)^n)/8. - _Luce ETIENNE_, Jul 26 2014
%F G.f.: x^2*(x^3+x^2+3*x+1) / ((x-1)^4*(x+1)^2). - _Colin Barker_, Feb 17 2015
%t t = Compile[{{n, _Integer}}, Module[{s = 0},
%t (Do[If[w + x == 2 y + 2 z, s = s + 1],
%t {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
%t Map[t[#] &, Range[0, 40]] (* A212561 *)
%t LinearRecurrence[{2,1,-4,1,2,-1},{0,0,1,5,12,26},50] (* _Harvey P. Dale_, Dec 04 2016 *)
%o (PARI) concat([0,0], Vec(x^2*(x^3+x^2+3*x+1)/((x-1)^4*(x+1)^2) + O(x^100))) \\ _Colin Barker_, Feb 17 2015
%Y Cf. A211795.
%K nonn,easy
%O 0,4
%A _Clark Kimberling_, May 21 2012
|
