cp's OEIS Frontend

A130589 a(n) = F(F(n)-1), where F(n) = A000045(n) (the Fibonacci numbers).

%I A130589 #13 Sep 21 2024 22:56:17
%S A130589 1,0,0,1,1,3,13,144,6765,3524578,86267571272,1100087778366101931,
%T A130589 343358302784187294870275058337,
%U A130589 1366619256256991435939546543402365995473880912459,1697726516284295515651670644354144400761613511040643009353262085480136081475307
%N A130589 a(n) = F(F(n)-1), where F(n) = A000045(n) (the Fibonacci numbers).
%H A130589 Alois P. Heinz, <a href="/A130589/b130589.txt">Table of n, a(n) for n = 0..19</a>
%e A130589 a(1)=F(F(1)-1)=F(0)=0;
%e A130589 a(2)=F(F(2)-1)=F(0)=0;
%e A130589 a(3)=F(F(3)-1)=F(1)=1;
%e A130589 a(4)=F(F(4)-1)=F(2)=1;
%e A130589 a(5)=F(F(5)-1)=F(4)=3;
%p A130589 with(combinat): a:= proc(n) fibonacci(fibonacci(n)-1) end proc: seq(a(n), n = 0 .. 14);
%p A130589 # second Maple program:
%p A130589 F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
%p A130589 a:= n-> F(F(n)-1):
%p A130589 seq(a(n), n=0..14);  # _Alois P. Heinz_, Nov 07 2018
%t A130589 Fibonacci[Fibonacci[Range[15]]-1] (* _Harvey P. Dale_, Feb 18 2018 *)
%Y A130589 Cf. A000045.
%Y A130589 Cf. A007570.
%K A130589 easy,nonn
%O A130589 0,6
%A A130589 Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Jun 16 2007
%E A130589 Edited by _Emeric Deutsch_, Jul 10 2007
%E A130589 a(0)=1 prepended by _Alois P. Heinz_, Nov 07 2018