OFFSET
1,1
LINKS
Metin Sariyar, Table of n, a(n) for n = 1..750
J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci and Lucas factorizations, Math. Comp. 50 (1988), 251-260, S1-S15. Math. Rev. 89h:11002.
Hisanori Mishima, Lucas numbers (n=1 to 100)
MAPLE
L:= gfun:-rectoproc({a(n)=a(n-1)+a(n-2), a(0)=2, a(1)=1}, a(n), remember):
S:= {}: Res:= NULL:
for n from 0 to 100 do
P:= numtheory:-factorset(L(n)) minus S;
Res:= Res, op(sort(convert(P, list)));
S:= S union P;
od:
Res; # Robert Israel, Jan 06 2020
MATHEMATICA
PrimeFactors[n_Integer] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; L[n_] := Fibonacci[n - 1] + Fibonacci[n + 1]; pf = {}; f[n_] := Block[{p = PrimeFactors[L[n]]}, l = Length[p]; k = 1; While[k <= l, If[ Position[ pf, p[[k]]] == {}, AppendTo[ pf, p[[k]] ]]; k++ ]]; Do[ f[n], {n, 40}]; pf (* Robert G. Wilson v, Jul 01 2004 *)
Drop[DeleteDuplicates[Flatten[Table[First/@FactorInteger[LucasL[n]], {n, 0, 100}]]], {2}] (* Vladimir Joseph Stephan Orlovsky, Feb 05 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Lekraj Beedassy, Jun 30 2004
EXTENSIONS
Edited, corrected and extended by Robert G. Wilson v, Jul 01 2004
STATUS
approved