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.

A084963 a(0) = 7, a(n+1) = Fibonacci(a(n)).

Original entry on oeis.org

7, 13, 233, 2211236406303914545699412969744873993387956988653
Offset: 0

Views

Author

Hollie L. Buchanan II, Jun 14 2003

Keywords

Comments

Iteration of the Fibonacci sequence.
a(3) = 2.2112... * 10^48.

Examples

			a(2) = F(a(1)) = F(13) = 233.
		

Crossrefs

Programs

  • Maple
    a:= proc(n) option remember; `if`(n=0, 7,
           (<<0|1>, <1|1>>^a(n-1))[1,2])
        end:
    seq(a(n), n=0..3);  # Alois P. Heinz, May 09 2020
  • Mathematica
    a[m_] := Module[{ex = 7}, Do[ex = Fibonacci[ex], {m}]; ex] Table[a[m], {m, 0, 3}]
    NestList[Fibonacci[#]&,7,3] (* Harvey P. Dale, Mar 18 2018 *)