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.

A111365 a(n) = 5*a(n-1) + 3*a(n-2) where a(0) = a(1) = 1.

Original entry on oeis.org

1, 1, 8, 43, 239, 1324, 7337, 40657, 225296, 1248451, 6918143, 38336068, 212434769, 1177182049, 6523214552, 36147618907, 200307738191, 1109981547676, 6150830952953, 34084099407793, 188872989897824, 1046617247712499
Offset: 0

Views

Author

Parthasarathy Nambi, Nov 07 2005

Keywords

Examples

			a(2) = 5*a(1) + 3*a(0) = 5*1 + 3*1 = 8 which is the third term in the sequence.
		

References

  • Thomas Koshy, "Fibonacci and Lucas Numbers with Applications", Wiley, 2001

Crossrefs

Programs

  • Mathematica
    Transpose[NestList[Flatten[{Rest[#],ListCorrelate[{3,5},#]}]&, {1,1},40]][[1]]  (* Harvey P. Dale, Mar 23 2011 *)

Formula

a(n)=A015536(n+1)-4*A015536(n). G.f.: (1-4x)/(1-5x-3x^2). [From R. J. Mathar, Jul 08 2009]

Extensions

More terms from Robert G. Wilson v, Nov 10 2005