|
| |
|
|
A094397
|
|
Numbers n such that n divides the (n+1)st Lucas number.
|
|
1
| |
|
|
1, 2, 44, 1364, 2204, 7964, 12524, 20569, 23804, 31124, 32642, 73124, 99644, 110564, 287804, 315524, 780044, 987524, 1050524, 1390724, 1585121, 1891124, 2158244, 2223836, 2430849, 2661164, 3725084, 4308524, 4831244, 6445724, 6458804, 7028564, 8997449
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Next term, if it exists, is >260000. - 110564 from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2005
|
|
|
MATHEMATICA
| Do[If[Mod[Fibonacci[n] + Fibonacci[n+2], n] == 0, Print[n]], {n, 1, 120000}] (Propper)
|
|
|
CROSSREFS
| Cf. A094396.
Sequence in context: A009620 A001627 A202747 * A140795 A161744 A054732
Adjacent sequences: A094394 A094395 A094396 * A094398 A094399 A094400
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Eric S Rowland (erowland(AT)math.rutgers.edu), May 01 2004
|
|
|
EXTENSIONS
| 110564 from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2005
19 more terms from Ryan Propper (rpropper(AT)stanford.edu), Jun 20 2005
|
| |
|
|
