A074806 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	PROG	`(PARI) a(n)=if(n<0, 0, s=1; while(fibonacci(s)%prime(n)<prime(n)-1, s++); s)`
	CROSSREFS	`Sequence in context: A201943 A201760 A046261 * A010634 A146179 A178414` `Adjacent sequences: A074803 A074804 A074805 * A074807 A074808 A074809`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 08 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.