Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A059794
%S A059794 0,0,2,4,44,28,356,712,2264,2008,26696,25672,356264,352168,343976,
%T A059794 687952,12186704,12121168,232530416,232268272,231743984,230695408,
%U A059794 5350034576,5345840272,26754367184,26737589968,80246324336,80179215472
%N A059794 n* - 2^(n-1), where n* (A003418) = least common multiple of the numbers 
               [1,...,n].
%C A059794 It is known that this sequence is always nonnegative - see references.
%C A059794 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.
%D A059794 M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 
               89 (1982) 126-129.
%D A059794 M. Nair, A new method in elementary prime number theory, J. London Math. 
               Soc. 25 (1982) 385-391
%D A059794 G. Tenenbaum, Introduction \`a la th\'eorie analytique et probabiliste 
               des nombres, pp. 12-13, Publications de l'Institut Cartan, 1990.
%H A059794 T. D. Noe, <a href="b059794.txt">Table of n, a(n) for n=1..200</a>
%e A059794 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.
%p A059794 A059794 := n->lcm(seq(i,i=1..n))-2^(n-1);
%Y A059794 Cf. A003418, A067068, A068510, A068511.
%Y A059794 Sequence in context: A009591 A009717 A018317 this_sequence A141142 A007596 
               A050588
%Y A059794 Adjacent sequences: A059791 A059792 A059793 this_sequence A059795 A059796 
               A059797
%K A059794 nice,nonn,easy
%O A059794 1,3
%A A059794 Kathleen Cussen (ehlana52(AT)hotmail.com), Feb 22 2001
%E A059794 Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 
               24 2001
%E A059794 References from Jean-Paul Allouche, Feb 17, 2002

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research