|
|
A084962
|
|
Iterations of the Fibonacci sequence starting at 6.
|
|
3
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The next term, a(4) = 1.695... * 10^2287, has 2288 digits and is too large to display.
This sequence is of interest because the sequences with this recurrence and a(0) in {0, 1, 2, 3, 4} all converge to 1 and the sequence with a(0) = 5 is constant.
|
|
LINKS
|
|
|
FORMULA
|
a(0) = 6, a(n) = Fibonacci(a(n-1)) for n>0.
|
|
EXAMPLE
|
a(3) = Fibonacci(a(2)) = Fibonacci(21) = 10946.
|
|
MAPLE
|
a:= proc(n) option remember; `if`(n=0, 6,
(<<0|1>, <1|1>>^a(n-1))[1, 2])
end:
|
|
MATHEMATICA
|
fibonaccieth6[m_] := Module[{ex = 6}, Do[ex = Fibonacci[ex], {m}]; ex] Table[fibonaccieth6[m], {m, 0, 4}]
|
|
PROG
|
(Scala) val fiboLimited: LazyList[Int] = 0 #:: 1 #:: fiboLimited.zip(fiboLimited.tail).map { n => n._1 + n._2 }
def fibonaccieth(start: Int): LazyList[Int] = LazyList.iterate(start)(fiboLimited)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|