The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #11 Apr 15 2023 23:32:35
%S 2,2,6,12,84,924,2772,80388,3778236,71786484,2943245844,585705922956,
%T 13471236227988,7018514074781748,1972202455013671188,
%U 61138276105423806828,134932175364670341669396,481842798227237790101413116,154671538230943330622553610236
%N Least common multiple of Lucas numbers L(0), L(1), ..., L(n).
%t Module[{nn=20,luc},luc=LucasL[Range[0,nn]];Rest[Table[LCM@@Take[luc,n],{n,nn}]]] (* _Harvey P. Dale_, Jun 29 2015 *)
%o (PARI) A000032(n) = fibonacci(n+1)+fibonacci(n-1)
%o a(n) = {v = 1; for (i=0, n, v = lcm(v, A000032(i));); return (v);} \\ _Michel Marcus_, Jul 22 2013
%Y Cf. A000032, A035105.
%K easy,nonn
%O 0,1
%A _Reiner Martin_, Jul 21 2001
%E a(0) and more terms from _Sean A. Irvine_, Apr 15 2023