|
Search: id:A069107
|
|
|
| A069107 |
|
Composite n such that n divides F(n+1) where F(k) are the Fibonacci numbers. |
|
+0
12
|
|
| 323, 377, 2834, 3827, 5777, 6479, 10877, 11663, 18407, 19043, 20999, 23407, 25877, 27323, 34943, 35207, 39203, 44099, 47519, 50183, 51983, 53663, 60377, 65471, 75077, 78089, 79547, 80189, 81719, 82983, 84279, 84419, 86063, 90287, 94667
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Primes p congruent to +2 or -2 (mod 5) divide F(p+1) (cf. A003631 and Hardy and Wright, An introduction to number theory, Chap. X, p. 150, Oxford University Press, Fifth edition).
|
|
CROSSREFS
|
Cf. A045468, A003631, A064739, A081264 (Fibonacci pseudoprimes).
Adjacent sequences: A069104 A069105 A069106 this_sequence A069108 A069109 A069110
Sequence in context: A082947 A082948 A081264 this_sequence A094412 A065822 A083138
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2002
|
|
EXTENSIONS
|
Corrected by Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 17 2002
|
|
|
Search completed in 0.002 seconds
|
