id:A086391 - OEIS Search Results

Search: id:A086391

Displaying 1-1 of 1 results found.

page 1

Numbers n such that F(n^2+1) == 1 (mod n) where F(k) denotes the k-th Fibonacci number.

+0
1

2, 3, 4, 7, 9, 10, 11, 12, 13, 17, 19, 20, 23, 24, 27, 28, 29, 31, 36, 37, 41, 43, 47, 48, 50, 53, 59, 60, 61, 63, 67, 71, 72, 73, 76, 79, 83, 84, 89, 96, 97, 99, 100, 101, 103, 107, 108, 109, 110, 113, 120, 127, 131, 137, 139, 140, 144, 149, 151, 157, 161, 163, 167, 168 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Except p=5, all prime numbers p are in the sequence.`
	CROSSREFS	`Sequence in context: A006549 A101128 A119345 this_sequence A120127 A047548 A095378` `Adjacent sequences: A086388 A086389 A086390 this_sequence A086392 A086393 A086394`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 06 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research