login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A190757
Lucas Aurifeuillian primitive part A of Lucas(10*n - 5).
2
1, 1, 101, 71, 181, 39161, 24571, 12301, 1158551, 87382901, 21211, 373270451, 28143378001, 32414581, 1322154751061, 9062194370461, 1550853481, 2819407321151, 265272771839851, 2366632711, 137083914639998701, 85417012034751151, 3455782010101
OFFSET
1,3
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..250
John Brillhart, Peter L. Montgomery and Robert D. Silverman, Tables of Fibonacci and Lucas factorizations, Math. Comp. 50 (1988), pp. 251-260, S1.
C. K. Caldwell, "Top Twenty" page, Lucas Aurifeuillian primitive part
FORMULA
a(n) = GCD(A061447(10*n-5), A027941(n-1)*A106729(n-1) + 1).
MATHEMATICA
lst = {1}; n = 23; Do[f = LucasL[k]; Do[f = f/GCD[f, lst[[d]]], {d, Most@Divisors[k]}]; AppendTo[lst, f], {k, 2, 10*n - 5}]; Table[GCD[lst[[5*k]], 5*Fibonacci[k]*(Fibonacci[k] - 1) + 1], {k, 1, 2*n - 1, 2}]
CROSSREFS
Sequence in context: A269503 A067748 A338615 * A212603 A278584 A282066
KEYWORD
nonn
AUTHOR
STATUS
approved