|
|
A099996
|
|
a(n) = lcm{1, 2, ..., 2*n}.
|
|
10
|
|
|
1, 2, 12, 60, 840, 2520, 27720, 360360, 720720, 12252240, 232792560, 232792560, 5354228880, 26771144400, 80313433200, 2329089562800, 144403552893600, 144403552893600, 144403552893600, 5342931457063200, 5342931457063200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The prime number theorem implies that a(n) = e^(2n(1+o(1))) as n -> infinity. In other words, log(a(n))/n -> 2 as n -> infinity. (Sondow)
|
|
LINKS
|
|
|
EXAMPLE
|
The LCM of {1,2,3,4,5,6} is 60 and 6 = 2*3, so a(3) = 60.
|
|
MAPLE
|
lcm(seq(i, i=1..2*n)) ;
|
|
PROG
|
(Haskell)
a099996 = foldl lcm 1 . enumFromTo 2 . (* 2)
(PARI) a(n) = lcm(vector(2*n, k, k)); \\ Michel Marcus, Mar 18 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|