|
Search: id:A131349
|
|
|
| A131349 |
|
Least Fibonacci number Fib_j greater that the previous term Fib_i such that Fib_j - Fib_i == 0 (mod n-1) with a(1)=1. |
|
+0
2
|
|
| 1, 2, 8, 89, 233, 46368, 14930352, 32951280099, 10610209857723, 72723460248141, 14472334024676221, 37889062373143906, 679891637638612258, 26925748508234281076009, 483162952612010163284885
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
Cf. A000045, A129896.
Sequence in context: A012295 A009486 A110384 this_sequence A067964 A126429 A098272
Adjacent sequences: A131346 A131347 A131348 this_sequence A131350 A131351 A131352
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 2007
|
|
|
Search completed in 0.002 seconds
|
