|
| |
|
|
A076518
|
|
Numbers n such that Fibonacci(n) == sigma(n) (mod n).
|
|
1
| |
|
|
1, 2, 4, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 120, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 348, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| It appears that most of the terms of this sequence satisfy Fibonacci(n) == 1 (mod n). Also it seems that most of the terms are primes.
|
|
|
MATHEMATICA
| Select[Range[10^4], Mod[Fibonacci[ # ], # ] == Mod[DivisorSigma[1, # ], # ] &]
|
|
|
CROSSREFS
| Sequence in context: A056395 A053031 A018674 * A139785 A000638 A039824
Adjacent sequences: A076515 A076516 A076517 * A076519 A076520 A076521
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 17 2002
|
| |
|
|
