|
Search: id:A123976
|
|
|
| A123976 |
|
Numbers n such that Fibonacci(n-1) is divisible by n. |
|
+0
1
|
|
| 1, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 442, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571, 599, 601
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) is a union of {1}, A069106(n) and A045468(n). Composite a(n) are listed in A069106(n) = {442, 1891, 2737, 4181, 6601, 6721, 8149, ...}. Prime a(n) are listed in A045468(n) = {11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, ...} Primes congruent to {1, 4} mod 5. - Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 02 2006
|
|
EXAMPLE
|
Fibonacci(10) = 55, is divisible by 11.
|
|
MATHEMATICA
|
Select[Range[1000], IntegerQ[Fibonacci[ # - 1]/# ] &]
|
|
CROSSREFS
|
Cf. A069106, A045468, A069104, A069107, A003631.
Sequence in context: A004769 A125771 A057538 this_sequence A045468 A053032 A034099
Adjacent sequences: A123973 A123974 A123975 this_sequence A123977 A123978 A123979
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Tanya Khovanova (tanyakh(AT)yahoo.com), Oct 30 2006
|
|
|
Search completed in 0.002 seconds
|
