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.

A027694 a(n) = n^2 + n + 9.

Original entry on oeis.org

9, 11, 15, 21, 29, 39, 51, 65, 81, 99, 119, 141, 165, 191, 219, 249, 281, 315, 351, 389, 429, 471, 515, 561, 609, 659, 711, 765, 821, 879, 939, 1001, 1065, 1131, 1199, 1269, 1341, 1415, 1491, 1569, 1649, 1731, 1815, 1901, 1989, 2079, 2171, 2265, 2361, 2459, 2559
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

For n > 3, a(n) = A176271(n+1,5). - Reinhard Zumkeller, Apr 13 2010
G.f.: (-9 + 16*x - 9*x^2)/(x-1)^3. - R. J. Mathar, Feb 07 2011
a(0) = 9, a(n) = a(n-1) + 2*n. - Vincenzo Librandi, Feb 07 2011
Sum_{n>=0} 1/a(n) = Pi*tanh(Pi*sqrt(35)/2)/sqrt(35). - Amiram Eldar, Jan 17 2021
From Elmo R. Oliveira, Oct 28 2024: (Start)
E.g.f.: exp(x)*(9 + 2*x + x^2).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)