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

A090585
Numerator of (Sum_{k=1..n} k) / (Product_{k=1..n} k).
13
1, 3, 1, 5, 1, 7, 1, 1, 1, 11, 1, 13, 1, 1, 1, 17, 1, 19, 1, 1, 1, 23, 1, 1, 1, 1, 1, 29, 1, 31, 1, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 1, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 1, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 1, 1, 83, 1
OFFSET
1,2
COMMENTS
If the offset is set to 2 then [a(n) <> 1] is the indicator function of the odd primes ([] Iverson bracket). [Peter Luschny, Jul 05 2009]
FORMULA
a(n) = A000217(n) / A069268(n).
a(n) = A089026(n+1) for n>1.
Also for n>1, a(n) is a numerator of determinant of (n-1) X (n-1) matrix with M(i,j) = (i+2)/(i+1) if i=j, otherwise 1. E.g., a(2) = Numerator[Det[{{3/2}}]] = Numerator[3/2] = 3. a(3) = Numerator[Det[{{3/2,1},{1,4/3}}]] = Numerator[1/1] = 1. a(4) = Numerator[Det[{{3/2,1,1},{1,4/3,1},{1,1,5/4}}]] = Numerator[5/12] = 5. - Alexander Adamchuk, May 26 2006
a(n) = gcd(n*(n+1)/2, n!+1). [Jaume Oliver Lafont, Jan 23 2009]
EXAMPLE
For n=5, (1+2+3+4+5)/(1*2*3*4*5) = 15/120 = 1/8, so a(5) = 1. For n=6, (1+2+3+4+5+6)/(1*2*3*4*5*6) = 21/720 = 7/240, so a(6) = 7. - Michael B. Porter, Jul 02 2016
MAPLE
a := n -> denom(2*n!/(n+1)); # Peter Luschny, Jul 05 2009
MATHEMATICA
With[{nn=100}, Numerator[Accumulate[Range[nn]]/Rest[FoldList[Times, 1, Range[nn]]]]] (* Harvey P. Dale, Sep 09 2014 *)
PROG
(PARI) for(n=1, 100, print1(gcd(n*(n+1)/2, round(factorial(n))+1), ", ")); \\ Jaume Oliver Lafont, Jan 23 2009
CROSSREFS
Denominator = A090586.
Sequence in context: A129510 A225656 A087913 * A309391 A147661 A155457
KEYWORD
nonn,frac
AUTHOR
Reinhard Zumkeller, Dec 03 2003
STATUS
approved