Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076988
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076988 Smallest Fibonacci number of the form n*k + 1 with k>0. +0
1
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; listen)
OFFSET

1,1

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: A085400 A067523 A035515 this_sequence A128369 A087568 A087564

Adjacent sequences: A076985 A076986 A076987 this_sequence A076989 A076990 A076991

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 25 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 26 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research