|
|
A131349
|
|
Least Fibonacci number Fibonacci(j) greater than the previous term a(n-1) such that Fibonacci(j) - a(n-1) == 0 (mod n-1) with a(1)=1.
|
|
1
|
|
|
1, 2, 8, 89, 233, 46368, 14930352, 32951280099, 10610209857723, 72723460248141, 14472334024676221, 37889062373143906, 679891637638612258, 26925748508234281076009, 483162952612010163284885, 59425114757512643212875125, 251728825683549488150424261
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
fibNbr[n_] := Round@ Log[ GoldenRatio, n*Sqrt@5]; g[lst_] := Block[{k, len = Length@lst, fa = Last@lst}, k = fibNbr@fa + 1; While[fb = Fibonacci@k; Mod[fb - fa, len] != 0, k++ ]; fb]; f[lst_] := Append[lst, g@lst]; Nest[f, {1}, 16]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|