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.

A067389 a(n) = 3*n^3 + 2*n^2 + n.

Original entry on oeis.org

0, 6, 34, 102, 228, 430, 726, 1134, 1672, 2358, 3210, 4246, 5484, 6942, 8638, 10590, 12816, 15334, 18162, 21318, 24820, 28686, 32934, 37582, 42648, 48150, 54106, 60534, 67452, 74878, 82830, 91326, 100384, 110022, 120258, 131110, 142596
Offset: 0

Views

Author

George E. Antoniou, Jan 21 2002

Keywords

Programs

Formula

a(n) = n*A056109(n) = A045991(n+1)+A033431(n). - Henry Bottomley, Jan 25 2002
From Chai Wah Wu, Apr 25 2017: (Start)
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n > 3.
G.f.: 2*x*(x^2 + 5*x + 3)/(x - 1)^4. (End)

Extensions

More terms from Henry Bottomley, Jan 25 2002