Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M0891 #38 Nov 15 2022 02:41:39
%S 1,1,2,3,8,34,377,17711,9227465,225851433717,2880067194370816120,
%T 898923707008479989274290850145,
%U 3577855662560905981638959513147239988861837901112,4444705723234237498833973519982908519933430818636409166351397897095281987215864
%N a(n) = Fibonacci(Fibonacci(n+1) + 1).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Alois P. Heinz, <a href="/A005370/b005370.txt">Table of n, a(n) for n = 0..18</a>
%p with(combinat, fibonacci): A005370 := n -> fibonacci(fibonacci(n+1)+1);
%p # second Maple program:
%p F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
%p a:= n-> F(F(n+1)+1):
%p seq(a(n), n=1..14); # _Alois P. Heinz_, Nov 05 2015
%t Table[Fibonacci[Fibonacci[n+1] +1], {n, 0, 14}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 08 2012 *)
%o (Magma) [Fibonacci(Fibonacci(n+1)+1): n in [0..17]]; // _Vincenzo Librandi_, Apr 20 2011
%o (SageMath) [fibonacci(fibonacci(n+1) +1) for n in range(15)] # _G. C. Greubel_, Nov 14 2022
%Y Cf. A000045, A007570.
%K nonn
%O 0,3
%A _N. J. A. Sloane_
%E More terms from _David W. Wilson_
%E Description corrected by Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 17 2002