cp's OEIS Frontend

A212565 Number of (w,x,y,z) with all terms in {1,...,n} and w+x>=2y+2z.

%I A212565 #11 Dec 05 2015 09:40:49
%S A212565 0,0,1,8,28,74,159,304,528,860,1325,1960,2796,3878,5243,6944,9024,
%T A212565 11544,14553,18120,22300,27170,32791,39248,46608,54964,64389,74984,
%U A212565 86828,100030,114675,130880,148736,168368,189873,213384,239004,266874,297103,329840
%N A212565 Number of (w,x,y,z) with all terms in {1,...,n} and w+x>=2y+2z.
%C A212565 For a guide to related sequences, see A211795.
%H A212565 Colin Barker, <a href="/A212565/b212565.txt">Table of n, a(n) for n = 0..1000</a>
%H A212565 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1,-5,5,1,-3,1).
%F A212565 a(n) = 3*a(n-1)-a(n-2)-5*a(n-3)+5*a(n-4)+a(n-5)-3*a(n-6)+a(n-7).
%F A212565 From _Colin Barker_, Dec 05 2015: (Start)
%F A212565 a(n) = 1/96*(14*n^4-12*n^3-8*n^2-6*((-1)^n-1)*n+3*((-1)^n-1)).
%F A212565 G.f.: x^2*(1+5*x+5*x^2+3*x^3) / ((1-x)^5*(1+x)^2).
%F A212565 (End)
%t A212565 t = Compile[{{n, _Integer}}, Module[{s = 0},
%t A212565 (Do[If[w + x >= 2 y + 2 z, s = s + 1],
%t A212565 {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
%t A212565 Map[t[#] &, Range[0, 40]]   (* A212565 *)
%o A212565 (PARI) concat([0,0], Vec(x^2*(1+5*x+5*x^2+3*x^3)/((1-x)^5*(1+x)^2) + O(x^100))) \\ _Colin Barker_, Dec 05 2015
%Y A212565 Cf. A211795.
%K A212565 nonn,easy
%O A212565 0,4
%A A212565 _Clark Kimberling_, May 21 2012