Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023174
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023174 Numbers n such that Fibonacci(n) == 2 (mod n). +0
1
1, 3, 6, 77, 93, 123, 143, 213, 237, 267, 453, 483, 573, 597, 627, 717, 723, 813, 843, 933, 1077, 1203, 1227, 1293, 1317, 1347, 1437, 1517, 1563, 1707, 1763, 1797, 1803, 1893, 1923, 2157, 2253, 2283, 2307, 2427, 2517, 2643, 2691, 2733, 2757, 2787, 2973, 3021 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A068665 A050722 A069502 this_sequence A157197 A036286 A084008

Adjacent sequences: A023171 A023172 A023173 this_sequence A023175 A023176 A023177

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research