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.

A010011 a(0) = 1, a(n) = 21*n^2 + 2 for n>0.

Original entry on oeis.org

1, 23, 86, 191, 338, 527, 758, 1031, 1346, 1703, 2102, 2543, 3026, 3551, 4118, 4727, 5378, 6071, 6806, 7583, 8402, 9263, 10166, 11111, 12098, 13127, 14198, 15311, 16466, 17663, 18902, 20183, 21506, 22871, 24278, 25727, 27218, 28751, 30326, 31943, 33602, 35303
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A206399.

Programs

Formula

O.g.f.: 1-x*(23+17*x+2*x^2)/(-1+x)^3. - R. J. Mathar, Apr 12 2008
E.g.f.: (21*x*(x+1)+2)*e^x-1. - Gopinath A. R., Feb 13 2012
Sum_{n>=0} 1/a(n) = 3/4+sqrt(42)/84*Pi*coth( Pi*sqrt(42)/21) = 1.0738233857899... - R. J. Mathar, May 07 2024
a(n) = A069178(n)+A069178(n+1). - R. J. Mathar, May 07 2024