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!)
A213502 Number of (w,x,y) with all terms in {0,...,n} and x != min(|w-x|, |x-y|). 1

%I #21 Feb 19 2024 11:42:58

%S 0,4,17,47,98,178,291,445,644,896,1205,1579,2022,2542,3143,3833,4616,

%T 5500,6489,7591,8810,10154,11627,13237,14988,16888,18941,21155,23534,

%U 26086,28815,31729,34832,38132,41633,45343,49266,53410,57779

%N Number of (w,x,y) with all terms in {0,...,n} and x != min(|w-x|, |x-y|).

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

%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.: x*(4 + 5*x + 4*x^2 - x^3))/((1 - x)^4*(1 + x)).

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

%F a(n) = (2*n*(2*n^2+4*n+1) - (-1)^n + 1)/4. - _Bruno Berselli_, Jul 02 2012

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

%t m = Map[t[#] &, Range[0, 60]]

%Y Cf. A212959, A213398.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Jun 14 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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)