login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086391 Numbers n such that F(n^2+1) == 1 (mod n) where F(k) denotes the k-th Fibonacci number. 0
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Except p=5, all prime numbers p are in the sequence.

CROSSREFS

Sequence in context: A182802 A172024 A119345 * A120127 A047548 A095378

Adjacent sequences:  A086388 A086389 A086390 * A086392 A086393 A086394

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 06 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 08:47 EST 2012. Contains 205614 sequences.