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!)
A076988 Smallest Fibonacci number of the form n*k + 1 with k>0. 0

%I #6 Dec 05 2013 19:55:48

%S 2,3,13,5,21,13,8,89,55,21,34,13,144,1597,63245986,28657,987,55,1597,

%T 21,610,89,17711,28657,4807526976,514229,55,1597,233,165580141,514229,

%U 2971215073,34,987,17711,28657,14930352,1597,139583862445,956722026041

%N Smallest Fibonacci number of the form n*k + 1 with k>0.

%e a(3) = 13 as 13 =3*4 + 1 is the smallest such Fibonacci number.

%p with(combinat, fibonacci):a[1] := 2:for n from 2 to 75 do j := 3:while((fibonacci(j) mod n)<>1)do j := j+1:od:a[n] := fibonacci(j):od:seq(a[k],k=1..75);

%K nonn

%O 1,1

%A _Amarnath Murthy_, Oct 25 2002

%E More terms from _Sascha Kurz_, Jan 26 2003

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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)