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.

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

Original entry on oeis.org

6, 12, 60, 180, 2520, 1008, 18144, 18144, 3991680, 5987520, 155675520, 1089728640, 26153487360, 523069747200, 17784371404800, 12312257126400, 935731541606400, 4678657708032, 12772735542927360, 140500090972200960
Offset: 0

Views

Author

Jonathan Sondow, Oct 18 2006

Keywords

Examples

			a(2) = 60 because (2+3)!/(d(2)*d(3)*d(4)) = 5!/(GCD(2,5)*GCD(6,16)*GCD(24,65)) = 120/2 = 60.
		

Crossrefs

Programs

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

Formula

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