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.

A189732 a(1)=1, a(2)=5, a(n) = a(n-1) + 5*a(n-2).

Original entry on oeis.org

1, 5, 10, 35, 85, 260, 685, 1985, 5410, 15335, 42385, 119060, 330985, 926285, 2581210, 7212635, 20118685, 56181860, 156775285, 437684585, 1221561010, 3409983935, 9517788985, 26567708660, 74156653585, 206995196885, 577778464810, 1612754449235, 4501646773285
Offset: 1

Views

Author

Harvey P. Dale, Apr 26 2011

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{1,5},{1,5},40]
  • Maxima
    a[1]:1$ a[2]:5$ a[n]:=a[n-1]+5*a[n-2]$ makelist(a[n], n, 1, 29);  /* Bruno Berselli, May 24 2011 */
    
  • PARI
    a(n)=([0,1; 5,1]^(n-1)*[1;5])[1,1] \\ Charles R Greathouse IV, Oct 21 2022

Formula

G.f.: x*(1+4*x)/(1-x-5*x^2). - Bruno Berselli, May 24 2011
a(n+1) = Sum_{k=0..n} A119473(n,k)*4^k. - Philippe Deléham, Oct 05 2012