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.

A024013 2^n-n^3.

Original entry on oeis.org

1, 1, -4, -19, -48, -93, -152, -215, -256, -217, 24, 717, 2368, 5995, 13640, 29393, 61440, 126159, 256312, 517429, 1040576, 2087891, 4183656, 8376441, 16763392, 33538807, 67091288, 134198045, 268413504, 536846523, 1073714824, 2147453857, 4294934528
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. sequences of the form k^n-n^3: this sequence (k=2), A024026 (k=3), A024039 (k=4), A024052 (k=5), A024065 (k=6), A024078 (k=7), A024091 (k=8), A024104 (k=9), A024117 (k=10), A024130 (k=11), A024143 (k=12).

Programs

Formula

G.f.: (-1-3*x^4-3*x^3-4*x^2+5*x)/((-1+2*x)*(x-1)^4). [Maksym Voznyy (voznyy(AT)mail.ru), Aug 14 2009]
a(n) = 6*a(n-1)-14*a(n-2)+16*a(n-3)-9*a(n-4)+2*a(n-5) for n>4. - Vincenzo Librandi, Oct 06 2014