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.

A190953 a(n) = 8*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 8, 74, 672, 6116, 55648, 506344, 4607232, 41921296, 381442688, 3470754464, 31580462592, 287351245376, 2614614588928, 23790429165184, 216469579210752, 1969660925337856, 17921983194810368, 163072474811861504, 1483799630442995712, 13501121791662580736
Offset: 0

Views

Author

Keywords

Programs

  • Magma
    I:=[0,1]; [n le 2 select I[n] else 8*Self(n-1) + 10*Self(n-2): n in [1..30]]; // G. C. Greubel, Jan 24 2018
  • Mathematica
    LinearRecurrence[{8,10}, {0,1}, 50]
  • PARI
    x='x+O('x^30); concat([0], Vec(x/(1-8*x-10*x^2))) \\ G. C. Greubel, Jan 24 2018
    

Formula

G.f.: x/(1 - 8*x - 10*x^2). - R. J. Mathar, Nov 21 2011