login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
1, 2, 8, 89, 233, 46368, 14930352, 32951280099, 10610209857723, 72723460248141, 14472334024676221, 37889062373143906, 679891637638612258, 26925748508234281076009, 483162952612010163284885 (list; graph; refs; listen; history; internal format)
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: A009486 A110384 A153887 * A067964 A126429 A098272

Adjacent sequences:  A131346 A131347 A131348 * A131350 A131351 A131352

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:29 EST 2012. Contains 205570 sequences.