login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213045 Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y). 2

%I #25 Feb 19 2024 12:10:31

%S 0,4,14,36,72,128,206,312,448,620,830,1084,1384,1736,2142,2608,3136,

%T 3732,4398,5140,5960,6864,7854,8936,10112,11388,12766,14252,15848,

%U 17560,19390,21344,23424,25636,27982,30468,33096,35872,38798,41880

%N Number of (w,x,y) with all terms in {0,...,n} and 2*|w-x| > max(w,x,y) - min(w,x,y).

%C Every term is even.

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

%F a(n) = 3*a(n-1) - 2*a(n-2) - 2*a(n-3) + 3*a(n-4) - a(n-5).

%F G.f.: 2*x*(2 + x + x^2)/((-1 + x)^4*(1 + x)).

%F a(n) = (n+1)^3 - A087035(n+1).

%F a(n) = 2*A212685(n+1) = (2*n*(4*n^2+9*n+8) - 3*(-1)^n + 3)/12. [_Bruno Berselli_, Jun 11 2012]

%t t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[Max[w, x, y] - Min[w, x, y] < 2 Abs[w - x], s = s + 1], {w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]];

%t m = Map[t[#] &, Range[0, 45]] (* this sequence *)

%t m/2 (* integers *)

%t LinearRecurrence[{3,-2,-2,3,-1},{0,4,14,36,72},50] (* _Harvey P. Dale_, Jul 31 2013 *)

%Y See A212959 for a guide to related sequences.

%Y Cf. A087035, A212685.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Jun 10 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)