login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068083 a(1) = 1, a(n) is the smallest Fibonacci number of the form k*a(n-1) + 1 with k>0. 0

%I #6 Jun 24 2014 01:08:22

%S 1,2,3,13,144,28657,701408733,679891637638612258,

%T 394810887814999156320699623170776339,

%U 215414832505658809004682396169711233230800418578767753330908886771798637

%N a(1) = 1, a(n) is the smallest Fibonacci number of the form k*a(n-1) + 1 with k>0.

%e a(5) = 144 = 11*13 + 1, a(4) = 13.

%t a[1]=1; a[n_] := a[n]=For[r=3, True, r++, If[Mod[Fibonacci[r]-1, a[n-1]]==0, Return[Fibonacci[r]]]]

%K nonn

%O 1,2

%A _Amarnath Murthy_, Feb 18 2002

%E Edited by _Dean Hickerson_, Feb 20 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 11:13 EDT 2024. Contains 372387 sequences. (Running on oeis4.)