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.

A153382 a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.

Original entry on oeis.org

0, 8, 10, 18, 30, 48, 80, 128, 210, 338, 550, 888, 1440, 2328, 3770, 6098, 9870, 15968, 25840, 41808, 67650, 109458, 177110, 286568, 463680, 750248, 1213930, 1964178, 3178110, 5142288, 8320400, 13462688, 21783090, 35245778, 57028870, 92274648
Offset: 0

Views

Author

Paul Curtz, Dec 25 2008

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{1, 2, -1, -1}, {0, 8, 10, 18}, 50] (* Paolo Xausa, Jan 19 2024 *)

Formula

From R. J. Mathar, Jan 03 2009: (Start)
G.f.: 2x(4+x-4x^2)/((1-x)(1+x)(1-x-x^2)).
a(n) = -2*A000035(n)+10*A000045(n). (End)

Extensions

Extended by R. J. Mathar, Jan 03 2009