Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086390 Composite n such that F(n^2+1)==1 (mod n) where F(k) denotes the k-th Fibonacci number. +0
1
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; listen)
OFFSET

1,1

CROSSREFS

Cf. A086367.

Sequence in context: A046030 A125726 A155879 this_sequence A038029 A020672 A028837

Adjacent sequences: A086387 A086388 A086389 this_sequence A086391 A086392 A086393

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research