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.

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

Original entry on oeis.org

0, 1, 10, 108, 1160, 12464, 133920, 1438912, 15460480, 166116096, 1784844800, 19177376768, 206052526080, 2213944274944, 23787862958080, 255590183780352, 2746204741468160, 29506768884924416, 317037326780989440, 3406427418889289728, 36600572803140812800
Offset: 0

Views

Author

Keywords

Programs

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

Formula

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