|
|
A328784
|
|
Integers k such that the k-th prime divides the k-th Lucas number.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MAPLE
|
a:= 1:
b:= 2:
p:= 2:
Res:= NULL:
for n from 2 to 10^6 do
c:= a+b;
b:= a;
a:= c;
p:= nextprime(p);
if a mod p = 0 then
Res:= Res, n;
fi
od:
|
|
PROG
|
(Magma) [n: n in [1..100000] | IsZero(Lucas(n) mod NthPrime(n))];
|
|
CROSSREFS
|
Cf. A075702 (analog with Fibonacci).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|