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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086390 Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number. 0
4, 9, 10, 12, 20, 24, 27, 28, 36, 48, 50, 60, 63, 72, 76, 84, 96, 99, 100, 108, 110, 120, 140, 144, 161, 168, 180, 192, 196, 204, 216, 220, 228, 231, 240, 250, 252, 276, 288, 300, 323, 324, 336, 341, 351, 360, 364, 369, 377, 384, 408, 420, 432, 451, 456, 480 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A086367.

Sequence in context: A180149 A155879 A172192 * A038029 A197039 A020672

Adjacent sequences:  A086387 A086388 A086389 * A086391 A086392 A086393

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 15 15:18 EST 2012. Contains 205823 sequences.