A074806 Least k such that F(k) reduced (mod prime(n)) = prime(n)-1 where F(k) is the k-th Fibonacci number.

1, 3, 9, 7, 8, 13, 17, 16, 23, 12, 28, 37, 19, 43, 15, 53, 56, 29, 67, 68, 73, 76, 83, 21, 97, 48, 103, 35, 53, 37, 127, 128, 137, 44, 73, 48, 157, 163, 167, 173, 176, 88, 188, 193, 197, 20, 40, 223, 227, 112, 25, 236, 119, 248, 257, 87, 133, 268, 277, 27, 283, 293, 43

Offset

1,2

Links

Table of n, a(n) for n=1..63.

Prog

(PARI) a(n)=if(n<0, 0, s=1; while(fibonacci(s)%prime(n)<prime(n)-1, s++); s)

Crossrefs

Sequence in context: A358614 A201760 A046261 * A010634 A362150 A267363

Adjacent sequences: A074803 A074804 A074805 * A074807 A074808 A074809

Keyword

nonn

Author

Benoit Cloitre, Sep 08 2002

Status

approved