login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084963 a(0) = 7, a(n+1) = Fibonacci(a(n)). 1
7, 13, 233, 2211236406303914545699412969744873993387956988653 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Iteration of the Fibonacci sequence.
a(3) = 2.2112... * 10^48.
LINKS
EXAMPLE
a(2) = F(a(1)) = F(13) = 233.
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 *)
CROSSREFS
Sequence in context: A181492 A243368 A317209 * A139188 A064119 A224984
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 19:10 EDT 2024. Contains 372004 sequences. (Running on oeis4.)