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.

A109873 a(n) = product of terms in row n of Pascal's triangle (A001142) divided by n^k, where n^k is the largest power of n dividing it.

Original entry on oeis.org

1, 1, 1, 6, 4, 125, 225, 336140, 2458624, 324060912, 8930250000, 835597712998125, 9001015156742400, 6600661714966989472803, 68987440762943255933340961, 28036608657071518646200652343750, 377177413291384771899817984000000
Offset: 1

Views

Author

Amarnath Murthy, Jul 10 2005

Keywords

Comments

If p is a prime then a(p) = A001142(p)/(p^(p-1)).

Examples

			a(5) = 1*5*10*10*5*1/625= 4.
		

Crossrefs

Programs

  • Maple
    A001142 := proc(n) local k ; mul(k^(2*k-1-n),k=1..n) ; end: A109873 := proc(n) local a; a := A001142(n) ; while a mod n = 0 and a > 1 do a := a/n ; od; RETURN(a) ; end: seq(A109873(n),n=1..20) ; # R. J. Mathar, Aug 15 2007

Extensions

More terms from R. J. Mathar, Aug 15 2007