|
Search: id:A130589
|
|
|
| A130589 |
|
a(n)=F(F(n)-1), where F(n)=A000045(n) (the Fibonacci numbers). |
|
+0
1
|
|
| 0, 0, 1, 1, 3, 13, 144, 6765, 3524578, 86267571272, 1100087778366101931, 343358302784187294870275058337, 1366619256256991435939546543402365995473880912459
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
F(F(n+1)=A007570(n+1), namely, 1,1,2,5,21,233,...
|
|
EXAMPLE
|
a(1)=F(F(1)-1)=F(0)=0;
a(2)=F(F(2)-1)=F(0)=0;
a(3)=F(F(3)-1)=F(1)=1;
a(4)=F(F(4)-1)=F(2)=1;
a(5)=F(F(5)-1)=F(4)=3;
|
|
MAPLE
|
with(combinat): a := proc (n) options operator, arrow; fibonacci(fibonacci(n)-1) end proc: seq(a(n), n = 1 .. 14);
|
|
CROSSREFS
|
Cf. A000045.
Cf. A007570.
Sequence in context: A121921 A161677 A054933 this_sequence A041591 A001150 A108554
Adjacent sequences: A130586 A130587 A130588 this_sequence A130590 A130591 A130592
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Jun 16 2007
|
|
EXTENSIONS
|
Edited by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 10 2007
|
|
|
Search completed in 0.002 seconds
|
