[go: up one dir, main page]

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

%I #14 Mar 09 2016 05:23:42

%S 0,1,16,64,196,441,900,1600,2704,4225,6400,9216,12996,17689,23716,

%T 30976,40000,50625,63504,78400,96100,116281,139876,166464,197136,

%U 231361,270400,313600,362404,416025,476100,541696,614656,693889,781456

%N Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<=2z.

%C For a guide to related sequences, see A211795.

%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,-6,0,6,-2,-2,1).

%F a(n) = 2a(n-1)+2a(n-2)-6a(n-3)+6a(n-5)-2a(n-6)-2a(n-7)+a(n-8).

%F From _Alois P. Heinz_, May 31 2012: (Start)

%F a(n) = A006578(n)^2.

%F G.f.: x*(14*x+30*x^2+42*x^3+17*x^4+4*x^5+1) / ((x+1)^3*(1-x)^5). (End)

%p a:= n-> (n*(n+1)/2+floor(n^2/4))^2:

%p seq(a(n), n=0..60); # _Alois P. Heinz_, May 31 2012

%t t = Compile[{{n, _Integer}}, Module[{s = 0},

%t (Do[If[w <= 2 x && y <= 2 z, s = s + 1],

%t {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];

%t Map[t[#] &, Range[0, 40]] (* A212506 *)

%Y Cf. A211795.

%K nonn,easy

%O 0,3

%A _Clark Kimberling_, May 19 2012