cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A102582 Numbers n such that denominator of Sum_{k=0..4n+1} 1/k! is (4n+1)!/2.

Original entry on oeis.org

1, 3, 5, 15, 16, 21, 23, 28, 31, 35, 40, 41, 48, 60, 61, 68, 75, 80, 81, 85, 86, 88, 93, 96, 98, 100, 105, 111, 115, 118, 126, 131, 133, 138, 145, 146, 150, 151, 153, 156, 163, 178, 183, 190, 191, 200, 208, 211, 213, 226, 230, 243, 245, 248, 250, 256, 260, 261, 265
Offset: 1

Views

Author

Jonathan Sondow, Jan 21 2005

Keywords

Comments

The denominator of Sum_{k=0 to m} 1/k! is m!/d, where d = A093101(m). If m = 4n+1 > 1, then d is even. n is a member when d = 2.

Examples

			1/0! + 1/1! + 1/2! + 1/3! + 1/4! + 1/5! = 163/60 and 60 = 5!/2 = (4*1+1)!/2, so 1 is a member.
		

Crossrefs

n is a member <=> 2n is a member of A102581 <=> A093101(4n+1) = 2 <=> A061355(4n+1) = (4n+1)!/2.

Programs

  • Mathematica
    fQ[n_] := (Denominator[ Sum[1/k!, {k, 0, 4n + 1}]] == (4n + 1)!/2); Select[ Range[0, 274], fQ[ # ] &] (* Robert G. Wilson v, Jan 24 2005 *)

Formula

a(n) = A102581(n+1)/2.

Extensions

More terms from Robert G. Wilson v, Jan 24 2005

A102584 a(n) = 1/2 times the cancellation factor in reducing Sum_{k=0 to 2n+1} 1/k! to lowest terms.

Original entry on oeis.org

1, 1, 10, 5, 4, 1, 2, 65, 2000, 1, 26, 247, 20, 5, 2, 19, 8, 115, 10, 23, 52, 31, 10, 65, 416, 37, 2, 25, 20, 1, 38, 1, 40, 325, 1406, 37, 676, 65, 10, 63829, 368, 1, 230, 5, 4, 1, 26, 5, 40, 247, 26, 43, 3100, 9785, 2, 1, 256, 5, 2050, 13, 388, 1, 4810, 1495, 8, 23, 254, 5
Offset: 1

Views

Author

Jonathan Sondow, Jan 22 2005

Keywords

Comments

The denominator of Sum_{k=0 to m} 1/k! is m!/d, where d = A093101(m). If m = 2n+1 > 1, then d is even and a(n) = d/2.

Examples

			1/0! + 1/1! + 1/2! + 1/3! + 1/4! + 1/5! + 1/6! + 1/7! = 13700/5040 = (20*685)/(20*252) and 7 = 2*3+1, so a(3) = 20/2 = 10.
		

Crossrefs

a(n) = A093101(2n+1)/2 = (2n+1)!/(2*A061355(2n+1)).
See also A102581, A102582.

Programs

  • PARI
    a(n) = {my(m = (2*n+1), s = 1, prt = m); for (k=1, m, s += prt; prt *= (m-k);); gcd(m!, s)/2;} \\ Michel Marcus, Sep 29 2017

Formula

a(n) = gcd(m!, 1+m+m(m-1)+m(m-1)(m-2)+...+m!)/2, where m = 2n+1.
Showing 1-2 of 2 results.