id:A074806 - OEIS Search Results

Search: id:A074806

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified May 13 01:46 EDT 2008. Contains 139661 sequences.

AT&T Labs Research