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.

A111433 Fibonacci(pentanacci(n)).

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 1, 3, 21, 987, 1346269, 2504730781961, 5358359254990966640871840, 9366947731425726508977331996039353971111632790877, 4176188314410464025148116525118839856571907649518456624120477965205524606115754507996484677228773
Offset: 0

Views

Author

Jonathan Vos Post, Nov 13 2005

Keywords

Examples

			a(0) = Fibonacci(pentanacci(0)) = A000045(A001591(0)) = A000045(0) = 0.
a(1) = Fibonacci(pentanacci(1)) = A000045(A001591(1)) = A000045(0) = 0.
a(2) = Fibonacci(pentanacci(2)) = A000045(A001591(2)) = A000045(0) = 0.
a(3) = Fibonacci(pentanacci(3)) = A000045(A001591(3)) = A000045(0) = 0.
a(4) = Fibonacci(pentanacci(4)) = A000045(A001591(4)) = A000045(1) = 1.
a(5) = Fibonacci(pentanacci(5)) = A000045(A001591(5)) = A000045(1) = 1.
a(6) = Fibonacci(pentanacci(6)) = A000045(A001591(6)) = A000045(2) = 1.
a(7) = A000045(A001591(7)) = A000045(4) = 3.
a(8) = A000045(A001591(8)) = A000045(8) = 21.
a(9) = A000045(A001591(9)) = A000045(16) = 987.
		

Crossrefs

Formula

a(n) = A000045(A001591(n)).