|
Search: id:A059794
|
|
|
| A059794 |
|
n* - 2^(n-1), where n* (A003418) = least common multiple of the numbers [1,...,n]. |
|
+0
4
|
|
| 0, 0, 2, 4, 44, 28, 356, 712, 2264, 2008, 26696, 25672, 356264, 352168, 343976, 687952, 12186704, 12121168, 232530416, 232268272, 231743984, 230695408, 5350034576, 5345840272, 26754367184, 26737589968, 80246324336, 80179215472
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
It is known that this sequence is always nonnegative - see references.
Comment from Paul Mills, Feb 14 2002: lcm(1,2,3...n) = n* lcm( binomial(n-1,0), binomial(n-1,1),..., binomial(n-1,n-1)) - see American Mathematical Monthly E2686.
|
|
REFERENCES
|
M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 89 (1982) 126-129.
M. Nair, A new method in elementary prime number theory, J. London Math. Soc. 25 (1982) 385-391
G. Tenenbaum, Introduction \`a la th\'eorie analytique et probabiliste des nombres, pp. 12-13, Publications de l'Institut Cartan, 1990.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..200
|
|
EXAMPLE
|
Let n=4. Then n*=12 and 2^(4-1)=8. Then we calculate 12-8=4 to be the second term of the sequence.
|
|
MAPLE
|
A059794 := n->lcm(seq(i, i=1..n))-2^(n-1);
|
|
CROSSREFS
|
Cf. A003418, A067068, A068510, A068511.
Sequence in context: A009591 A009717 A018317 this_sequence A141142 A007596 A050588
Adjacent sequences: A059791 A059792 A059793 this_sequence A059795 A059796 A059797
|
|
KEYWORD
|
nice,nonn,easy
|
|
AUTHOR
|
Kathleen Cussen (ehlana52(AT)hotmail.com), Feb 22 2001
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 24 2001
References from Jean-Paul Allouche, Feb 17, 2002
|
|
|
Search completed in 0.002 seconds
|
