|
Search: id:A053685
|
|
|
| A053685 |
|
Primes p>7 which are congruent to 2 or 4 (mod 5) for which 2p-1 is also prime. |
|
+0
2
|
|
| 19, 37, 79, 97, 139, 157, 199, 229, 307, 337, 367, 379, 439, 499, 547, 577, 607, 619, 727, 829, 877, 937, 967, 997, 1009, 1069, 1237, 1279, 1297, 1399, 1429, 1459, 1609, 1627, 1657, 1759, 1867, 2029, 2089, 2137, 2179, 2467, 2539, 2557, 2617, 2707, 2719
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For such primes p, 2p-1 divides Fibonacci(p). Actually it is also true that (2m-1) divides Fibonacci(m) for *all* m>7, m=2 or 4 (mod 5) for which 2m-1 is prime.
|
|
REFERENCES
|
Vladimir Drobot, On primes in the Fibonacci sequence, Fibonacci Quarterly 38, no. 1 (2000), 71-72.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
EXAMPLE
|
Note that 19 is prime and so is 2*19-1 or 37.
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A158293 A107579 A050528 this_sequence A136063 A111441 A144594
Adjacent sequences: A053682 A053683 A053684 this_sequence A053686 A053687 A053688
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
James A. Sellers (sellersj(AT)math.psu.edu), Feb 15 2000
|
|
|
Search completed in 0.002 seconds
|
