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.

A089207 a(n) = 4n^3 + 2n^2.

Original entry on oeis.org

6, 40, 126, 288, 550, 936, 1470, 2176, 3078, 4200, 5566, 7200, 9126, 11368, 13950, 16896, 20230, 23976, 28158, 32800, 37926, 43560, 49726, 56448, 63750, 71656, 80190, 89376, 99238, 109800, 121086, 133120, 145926, 159528, 173950, 189216
Offset: 1

Views

Author

Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Dec 09 2003

Keywords

Comments

Yet another parametric representation of the solutions of the Diophantine equation x^2 - y^2 = z^3 is (3n^3, n^3, 2n^2). By taking the sum x+y+z we get a(n) = 4n^3 + 2n^2.
If Y is a 3-subset of an 2n-set X then, for n>=5, a(n-2) is the number of 5-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 16 2007

Crossrefs

Programs

  • Mathematica
    Table[4n^3+2n^2,{n,40}] (* Harvey P. Dale, Jun 12 2020 *)

Formula

a(n) = 2*A099721(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). G.f.: 2*x*(3+8*x+x^2)/(x-1)^4. [R. J. Mathar, Apr 20 2009]
a(n) = 2 * n * A014105(n). - Richard R. Forberg, Jun 16 2013

Extensions

More terms from Ray Chandler, Feb 15 2004