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.

A015544 Lucas sequence U(5,-8): a(n+1) = 5*a(n) + 8*a(n-1), a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 5, 33, 205, 1289, 8085, 50737, 318365, 1997721, 12535525, 78659393, 493581165, 3097180969, 19434554165, 121950218577, 765227526205, 4801739379641, 30130517107845, 189066500576353, 1186376639744525, 7444415203333449, 46713089134623445
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Magma
    [n le 2 select n-1 else 5*Self(n-1) + 8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 13 2012
    
  • Mathematica
    a[n_]:=(MatrixPower[{{1,2},{1,-6}},n].{{1},{1}})[[2,1]]; Table[Abs[a[n]],{n,-1,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
    LinearRecurrence[{5, 8}, {0, 1}, 30] (* Vincenzo Librandi, Nov 13 2012 *)
  • PARI
    A015544(n)=imag((2+quadgen(57))^n) \\ M. F. Hasler, Mar 06 2009
    
  • PARI
    x='x+O('x^30); concat([0], Vec(x/(1 - 5*x - 8*x^2))) \\ G. C. Greubel, Jan 01 2018
  • Sage
    [lucas_number1(n,5,-8) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009
    

Formula

a(n) = 5*a(n-1) + 8*a(n-2).
G.f.: x/(1 - 5*x - 8*x^2). - M. F. Hasler, Mar 06 2009

Extensions

More precise definition by M. F. Hasler, Mar 06 2009