|
Search: id:A129745
|
|
|
| A129745 |
|
Numbers n such that Lucas(4n)/7 is prime. |
|
+0
1
|
|
| 5, 17, 19, 41, 43, 71, 1511, 2339, 3469, 4787, 7211
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
L(k) = Lucas(k) = Fibonacci(k-1) + Fibonacci(k+1). 7 = L(4). 7 divides L(4(1+2k)). L(4n) = L(4)*L(4(n-1)) - L(4(n-2)). Conjecture: All terms are primes.
|
|
MATHEMATICA
|
a=7; b=47; Do[ c=7b-a; a=b; b=c; If[ PrimeQ[c/7], Print[n] ], {n, 3, 100}]
|
|
CROSSREFS
|
Cf. A000032, A001606 = Indices of prime Lucas numbers. Cf. A074304 = numbers n such that Lucas(2n)/3 is prime.
Sequence in context: A140568 A019349 A124873 this_sequence A038964 A019401 A153320
Adjacent sequences: A129742 A129743 A129744 this_sequence A129746 A129747 A129748
|
|
KEYWORD
|
less,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), May 14 2007, May 16 2007
|
|
EXTENSIONS
|
a(7) - a(10) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 17 2007
a(11) from Max Alekseyev (maxale(AT)gmail.com), Nov 25 2007
|
|
|
Search completed in 0.002 seconds
|
