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.

A027620 a(n) = n + (n+1)^2 + (n+2)^3.

Original entry on oeis.org

9, 32, 75, 144, 245, 384, 567, 800, 1089, 1440, 1859, 2352, 2925, 3584, 4335, 5184, 6137, 7200, 8379, 9680, 11109, 12672, 14375, 16224, 18225, 20384, 22707, 25200, 27869, 30720, 33759, 36992, 40425, 44064, 47915, 51984, 56277, 60800
Offset: 0

Views

Author

Keywords

Comments

Numbers n > 0 such that x^3 + 2*x^2 + n factors over the integers. - James R. Buddenhagen, Apr 19 2005

Crossrefs

Programs

Formula

a(n) = (n+1)*(n+3)^2. - Zerinvary Lajos, Sep 24 2006, corrected Dec 21 2010
G.f.: (9 - 4*x + x^2)/(1 - x)^4. - R. J. Mathar, Dec 21 2010
a(n) = coefficient of x^3 in the Maclaurin expansion of -1/((n+3)*x^2 + (n+3)*x + 1). - Francesco Daddi, Aug 04 2011
E.g.f.: (9 + 23*x + 10*x^2 + x^3)*exp(x). - G. C. Greubel, Aug 05 2022