cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A212683 Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.

Original entry on oeis.org

0, 0, 2, 8, 22, 46, 84, 138, 212, 308, 430, 580, 762, 978, 1232, 1526, 1864, 2248, 2682, 3168, 3710, 4310, 4972, 5698, 6492, 7356, 8294, 9308, 10402, 11578, 12840, 14190, 15632, 17168, 18802, 20536, 22374, 24318, 26372, 28538, 30820
Offset: 0

Views

Author

Clark Kimberling, May 24 2012

Keywords

Comments

For a guide to related sequences, see A211795.
Also the number of (w,x,y) with all terms in {0,...,n-1} and |w-x| < |x-y|, see A212959. - Clark Kimberling, Jun 02 2012

Crossrefs

Programs

  • Mathematica
    t = Compile[{{n, _Integer}}, Module[{s = 0},
    (Do[If[Abs[x - y] == w + Abs[y - z], s = s + 1],
    {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
    Map[t[#] &, Range[0, 40]]   (* A212683 *)
    %/2  (* A019298 *)
    LinearRecurrence[{3, -2, -2, 3, -1}, {0, 0, 2, 8, 22}, 40]

Formula

a(n) = 2*A019298(n-1) for n>=1.
a(n) = 3*a(n-1) - 2*a(n-2) - 2*a(n-3) + 3*a(n-4) - a(n-5).
G.f.: (2*x^2 + 2*x^3 + 2*x^4)/(1 - 3*x + 2*x^2 + 2*x^3 - 3*x^4 + x^5).
a(n) + A212684(n) = n^3. - Clark Kimberling, Jun 02 2012 [corrected by Jason Yuen, Aug 19 2025]
a(n) = (2*n^3 - 3*n^2 + 2*n - (n mod 2))/4. - Ayoub Saber Rguez, Sep 02 2021