|
Search: id:A093880
|
|
|
| A093880 |
|
LCM(1, 2, ..., 2n)/LCM(1, 2, ..., n). |
|
+0
3
|
|
| 2, 6, 10, 70, 42, 462, 858, 858, 4862, 92378, 8398, 193154, 74290, 222870, 6463230, 200360130, 11785890, 11785890, 22951470, 22951470, 941010270, 40463441610, 1759280070, 82686163290, 115760628606, 115760628606, 2045104438706
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Also, LCM(n+1,n+2,...,2n-1,2n)/LCM(1,2,...,n-1,n).
|
|
REFERENCES
|
J. Sondow, Criteria for irrationality of Euler's constant, Proc. Amer. Math. Soc. 131 (2003) 3335-3344.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..500
J. Sondow, Criteria for irrationality of Euler's constant
Eric Weisstein's World of Mathematics, Least Common Multiple
Index entries for sequences related to lcm's
|
|
FORMULA
|
The prime number theorem implies that a(n) = e^(n(1+o(1))) as n -> infinity. In other words, ln(a(n))/n -> 1 as n -> infinity. - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 17 2005
a(n) = A003418(2n)/A003418(n) = A099996(n)/A003418(n).
|
|
EXAMPLE
|
LCM of {1,2,3,4,5,6} is 60 and LCM of {1,2,3} is 6, so a(3) = 60/6 = 10.
|
|
MAPLE
|
a:=n->lcm(seq(j, j=n+1..2*n))/lcm(seq(j, j=1..n)): seq(a(n), n=1..32); (Deutsch)
|
|
MATHEMATICA
|
f[n_] := LCM @@ Table[i, {i, 2n}]/LCM @@ Table[i, {i, n}]; Table[ f[n], {n, 27}] (from Robert G. Wilson v Jan 22 2005)
|
|
CROSSREFS
|
Cf. A080397.
Sequence in context: A083524 A095107 A115113 this_sequence A080397 A122159 A048782
Adjacent sequences: A093877 A093878 A093879 this_sequence A093881 A093882 A093883
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 22 2004
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 02 2006
Entry revised by njas, Jan 24 2007
|
|
|
Search completed in 0.002 seconds
|
