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”).

a(n) = lcm(1,...,L(n)), where L(n) = n-th Lucas number.
2

%I #14 Mar 04 2018 16:09:40

%S 2,1,6,12,420,27720,12252240,2329089562800,442720643463713815200,

%T 410555180440430163438262940577600,

%U 10514768575588513054648621420819083891762891880353600,337293588832926264639465766794841407432394382785157234228847021917234018060677390066992000

%N a(n) = lcm(1,...,L(n)), where L(n) = n-th Lucas number.

%H Vincenzo Librandi, <a href="/A218492/b218492.txt">Table of n, a(n) for n = 0..16</a>

%t Table[Apply[LCM, Range[LucasL[k]]], {k, 0, 10}]

%Y Cf. A000032, A180402, A062954, A035105.

%K nonn

%O 0,1

%A _Vaclav Kotesovec_, Oct 30 2012