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.

A084380 a(n) = n^3 + 2.

Original entry on oeis.org

2, 3, 10, 29, 66, 127, 218, 345, 514, 731, 1002, 1333, 1730, 2199, 2746, 3377, 4098, 4915, 5834, 6861, 8002, 9263, 10650, 12169, 13826, 15627, 17578, 19685, 21954, 24391, 27002, 29793, 32770, 35939, 39306, 42877, 46658, 50655, 54874, 59321, 64002
Offset: 0

Views

Author

Cino Hilliard, Jun 23 2003

Keywords

Comments

This sequence contains no square numbers. A proof may be similar to the Hilliard link.

Crossrefs

Cf. sequences for n^3+7, n^3+17, n^3+3.
Essentially the same as A034324.

Programs

  • Magma
    I:=[2, 3, 10, 29]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3) -Self(n-4): n in [1..50]]; // Vincenzo Librandi, Jun 24 2012
  • Mathematica
    f[n_]:=n^3+2;f[Range[60]] (* Offset 1. *) (* Vladimir Joseph Stephan Orlovsky, Feb 14 2011 *)
    CoefficientList[Series[(2-5*x+10*x^2-x^3)/(x-1)^4,{x,0,50}],x] (* Vincenzo Librandi, Jun 24 2012 *)
  • PARI
    n3pm(n,m=2) = { for(x=0,n,y=x^3+m; print1(y,", ")) }
    

Formula

G.f.: (2 - 5*x + 10*x^2 - x^3) / (x-1)^4 . - R. J. Mathar, Feb 16 2011
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - Vincenzo Librandi, Jun 24 2012

Extensions

Extended to offset 0 by R. J. Mathar, Feb 16 2011