|
Search: id:A058036
|
|
|
| A058036 |
|
Smallest primitive prime factor of the n-th Lucas number (A000032); i.e. L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2). |
|
+0
3
|
|
| 2, 1, 3, 1, 7, 11, 1, 29, 47, 19, 41, 199, 23, 521, 281, 31, 2207, 3571, 107, 9349, 2161, 211, 43, 139, 1103, 101, 90481, 5779, 14503, 59, 2521, 3010349, 1087, 9901, 67, 71, 103681, 54018521, 29134601, 79, 1601, 370248451, 83, 6709, 263, 181, 4969
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
A Lucas number can have more than one primitive factor; the primitive factors of L(22) are 43 and 307.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000 (using Blair Kelly's data)
Blair Kelly, Fibonacci and Lucas Factorizations
|
|
MATHEMATICA
|
a=3; b=-1; prms={}; Table[c=a+b; a=b; b=c; f=First/@FactorInteger[c]; p=Complement[f, prms]; prms=Join[prms, p]; If[p=={}, 1, First[p]], {47}]
|
|
CROSSREFS
|
Cf. A000032.
Cf. A086600 (number of primitive prime factors in L(n)).
Sequence in context: A129646 A165401 A140966 this_sequence A136179 A126761 A090559
Adjacent sequences: A058033 A058034 A058035 this_sequence A058037 A058038 A058039
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 16 2000
|
|
|
Search completed in 0.002 seconds
|
