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

%I #12 Sep 29 2023 19:14:26

%S 7,13,233,2211236406303914545699412969744873993387956988653

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

%C Iteration of the Fibonacci sequence.

%C a(3) = 2.2112... * 10^48.

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

%p a:= proc(n) option remember; `if`(n=0, 7,

%p (<<0|1>, <1|1>>^a(n-1))[1,2])

%p end:

%p seq(a(n), n=0..3); # _Alois P. Heinz_, May 09 2020

%t a[m_] := Module[{ex = 7}, Do[ex = Fibonacci[ex], {m}]; ex] Table[a[m], {m, 0, 3}]

%t NestList[Fibonacci[#]&,7,3] (* _Harvey P. Dale_, Mar 18 2018 *)

%Y Cf. A000045, A084962.

%K nonn

%O 0,1

%A _Hollie L. Buchanan II_, Jun 14 2003

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 May 9 15:58 EDT 2024. Contains 372353 sequences. (Running on oeis4.)