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.

A123899 a(n) = (n+1)!/(d(n)*d(n+1)) where d(n) = cancellation factor in reducing Sum_{k=0...n} 1/k! to lowest terms.

Original entry on oeis.org

1, 2, 3, 12, 60, 360, 252, 2016, 36288, 362880, 4989600, 11975040, 622702080, 8717829120, 65383718400, 5230697472000, 2736057139200, 49249028505600, 30411275102208, 608225502044160, 25545471085854720000
Offset: 0

Views

Author

Jonathan Sondow, Oct 18 2006

Keywords

Examples

			a(2) = 3 because (2+1)!/(d(2)*d(3)) = 3!/(gcd(2,5)*gcd(6,16)) = 6/2 = 3.
		

Crossrefs

Programs

  • Mathematica
    (A[n_] := If[n==0,1,n*A[n-1]+1]; d[n_] := GCD[A[n],n! ]; Table[(n+1)!/(d[n]*d[n+1]), {n,0,22}])

Formula

a(n) = (n+1)!/(A093101(n)*A093101(n+1)) where A093101(n)=gcd(n!,1+n+n(n-1)+...+n!).