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.

A027689 a(n) = n^2 + n + 4.

Original entry on oeis.org

4, 6, 10, 16, 24, 34, 46, 60, 76, 94, 114, 136, 160, 186, 214, 244, 276, 310, 346, 384, 424, 466, 510, 556, 604, 654, 706, 760, 816, 874, 934, 996, 1060, 1126, 1194, 1264, 1336, 1410, 1486, 1564, 1644, 1726, 1810, 1896, 1984, 2074, 2166, 2260, 2356, 2454, 2554
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

a(n) = A000217(n-2) + A000217(n+2) for n > 0. - Jon Perry, Jul 23 2003
a(n) = 2*n + a(n-1)-2 (with a(1)=4). - Vincenzo Librandi, Aug 05 2010
Sum_{n>=0} 1/a(n) = Pi*tanh(Pi*sqrt(15)/2)/sqrt(15). - Amiram Eldar, Jan 18 2021
From Elmo R. Oliveira, Oct 28 2024: (Start)
G.f.: 2*(2 - 3*x + 2*x^2)/(1 - x)^3.
E.g.f.: (2*(2 + x) + x^2)*exp(x).
a(n) = 2*A152948(n+2). (End)