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.

A096376 a(n) = n + (n-1)^2 + (n+1)^2.

Original entry on oeis.org

2, 5, 12, 23, 38, 57, 80, 107, 138, 173, 212, 255, 302, 353, 408, 467, 530, 597, 668, 743, 822, 905, 992, 1083, 1178, 1277, 1380, 1487, 1598, 1713, 1832, 1955, 2082, 2213, 2348, 2487, 2630, 2777, 2928, 3083, 3242, 3405, 3572, 3743, 3918, 4097, 4280, 4467, 4658
Offset: 0

Views

Author

Odimar Fabeny, Aug 04 2004

Keywords

Comments

Numbers represented as 212 in number base n including binary with digits larger than 1: 212_2 = 12 and ternary 212_3 = 23. - Ron Knott, Nov 14 2017

Examples

			1 + 0 + 4 = 5, 2 + 1 + 9 = 12, 3 + 4 + 16 = 23, ...
		

Programs

Formula

a(n) = 2*n^2 + n + 2. - N. J. A. Sloane, Nov 10 2009
a(n) = 4*n + a(n-1) - 1 (with a(0)=2). - Vincenzo Librandi, Nov 16 2010
From Colin Barker, Oct 03 2012: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: (2 - x + 3*x^2)/(1-x)^3. (End)
E.g.f.: (2*x^2 + 3*x +2)*exp(x). - G. C. Greubel, Jul 16 2017