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.

A080861 a(n) = 15*n^2 + 6*n + 1.

Original entry on oeis.org

1, 22, 73, 154, 265, 406, 577, 778, 1009, 1270, 1561, 1882, 2233, 2614, 3025, 3466, 3937, 4438, 4969, 5530, 6121, 6742, 7393, 8074, 8785, 9526, 10297, 11098, 11929, 12790, 13681, 14602, 15553, 16534, 17545, 18586, 19657, 20758, 21889, 23050, 24241, 25462, 26713, 27994
Offset: 0

Views

Author

Paul Barry, Feb 23 2003

Keywords

Comments

The old definition of this sequence was "Generalized polygonal numbers".
Column T(n,6) of A080853.

Crossrefs

Cf. A080853.

Programs

Formula

a(n) = C(6,0) + C(6,1)*n + C(6,2)*n^2.
G.f.: (C(5,0) + (C(7,2)-2)*x + C(5,2)*x^2)/(1-x)^3 = (1 + 19*x + 10*x^2)/(1-x)^3.
From Elmo R. Oliveira, Oct 20 2024: (Start)
E.g.f.: exp(x)*(1 + 21*x + 15*x^2).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

Extensions

Definition replaced with the closed form by Bruno Berselli, Jan 16 2013