The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076988 Smallest Fibonacci number of the form n*k + 1 with k>0. 0
 2, 3, 13, 5, 21, 13, 8, 89, 55, 21, 34, 13, 144, 1597, 63245986, 28657, 987, 55, 1597, 21, 610, 89, 17711, 28657, 4807526976, 514229, 55, 1597, 233, 165580141, 514229, 2971215073, 34, 987, 17711, 28657, 14930352, 1597, 139583862445, 956722026041 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE a(3) = 13 as 13 =3*4 + 1 is the smallest such Fibonacci number. MAPLE 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); CROSSREFS Sequence in context: A067523 A035515 A317716 * A128369 A087568 A087564 Adjacent sequences:  A076985 A076986 A076987 * A076989 A076990 A076991 KEYWORD nonn AUTHOR Amarnath Murthy, Oct 25 2002 EXTENSIONS More terms from Sascha Kurz, Jan 26 2003 STATUS approved

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

Last modified September 26 02:39 EDT 2020. Contains 337346 sequences. (Running on oeis4.)