This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A061447 #19 Apr 03 2023 10:36:10
%S A061447 1,3,4,7,11,6,29,47,19,41,199,46,521,281,31,2207,3571,321,9349,2161,
%T A061447 211,13201,64079,2206,15251,90481,5779,101521,1149851,2521,3010349,
%U A061447 4870847,9901,4250681,64681,103681,54018521,29134601,67861,4868641,370248451
%N A061447 Primitive part of Lucas(n).
%H A061447 T. D. Noe, <a href="/A061447/b061447.txt">Table of n, a(n) for n=1..1000</a>
%H A061447 J. Brillhart, P. L. Montgomery and R. D. Silverman, <a href="https://doi.org/10.1090/S0025-5718-1988-0917832-6">Tables of Fibonacci and Lucas factorizations</a>, Math. Comp. 50 (1988), 251-260, S1-S15. Math. Rev. 89h:11002.
%H A061447 C. K. Caldwell, <a href="https://t5k.org/top20/page.php?id=21">Lucas Aurifeuillian primitive part</a>
%F A061447 Primitive part of L(n) is primitive part of F(2n).
%F A061447 a(n) = Product_{ d divides 2*n } Fibonacci(2*n/d)^mu(d). - _Vladeta Jovovic_, Mar 08 2004
%t A061447 t={1}; Do[f=LucasL[n]; Do[f=f/GCD[f,t[[d]]], {d,Most[Divisors[n]]}]; AppendTo[t,f], {n,2,100}]; t
%Y A061447 Cf. A061446, A061254, A061445, A061442, A061443.
%Y A061447 Cf. A126015
%K A061447 nonn
%O A061447 1,2
%A A061447 _David Broadhurst_, Jun 10 2001
%E A061447 More terms from _Vladeta Jovovic_, Mar 08 2004