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.

A347319 a(n) = (2*n+1)*(n^3-2*n^2+n+1).

Original entry on oeis.org

1, 3, 15, 91, 333, 891, 1963, 3795, 6681, 10963, 17031, 25323, 36325, 50571, 68643, 91171, 118833, 152355, 192511, 240123, 296061, 361243, 436635, 523251, 622153, 734451, 861303, 1003915, 1163541, 1341483, 1539091, 1757763, 1998945, 2264131, 2554863, 2872731, 3219373, 3596475, 4005771
Offset: 0

Views

Author

N. J. A. Sloane, Sep 12 2021

Keywords

Crossrefs

A bisection of A146212, analogous to A344866 and A344907.

Programs

Formula

From Chai Wah Wu, Sep 12 2021: (Start)
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n > 4.
G.f.: (-3*x^4 - 36*x^3 - 10*x^2 + 2*x - 1)/(x - 1)^5. (End)