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.

A108100 a(n) = (2*n-1)^2 + (2*n+1)^2.

Original entry on oeis.org

2, 10, 34, 74, 130, 202, 290, 394, 514, 650, 802, 970, 1154, 1354, 1570, 1802, 2050, 2314, 2594, 2890, 3202, 3530, 3874, 4234, 4610, 5002, 5410, 5834, 6274, 6730, 7202, 7690, 8194, 8714, 9250, 9802, 10370, 10954, 11554, 12170, 12802, 13450, 14114, 14794, 15490
Offset: 0

Views

Author

Dorthe Roel (dorthe_roel(AT)hotmail.com or dorthe.roel1(AT)skolekom.dk), Jun 07 2005

Keywords

Crossrefs

Apart from leading term, same as A008527.

Programs

Formula

From R. J. Mathar, Aug 24 2008: (Start)
O.g.f.: 2*(1 + 2*x + 5*x^2)/(1-x)^3.
a(n) = 2*A053755(n). (End)
a(n) = a(-n); a(n) + a(-n) = A158444(n). - Bruno Berselli, Sep 06 2011
a(n) = 2*(A000466(n) + 2). - Martin Ettl, Nov 12 2012
From Elmo R. Oliveira, Nov 16 2024: (Start)
E.g.f.: 2*exp(x)*(1 + 4*x + 4*x^2).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)