login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002176 a(n) = LCM of denominators of Cotesian numbers {C(n,k), 0 <= k <= n}.
(Formerly M1569 N0612)
15
2, 6, 8, 90, 288, 840, 17280, 28350, 89600, 598752, 87091200, 63063000, 402361344000, 5003856000, 2066448384, 976924698750, 3766102179840000, 15209113920000, 5377993912811520000, 1646485441080480, 89903156428800000 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

See A100640 for definition of C(n,k).

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 886.

Louis Brand, Differential and Difference Equations, 1966, p. 612.

W. W. Johnson, On Cotesian numbers: their history, computation and values to n=20, Quart. J. Pure Appl. Math., 46 (1914), 52-65.

Charles Jordan, Calculus of Finite Differences, Chelsea 1965, p. 513.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 886.

MAPLE

Define C(n, k) as in A100640, then: A002176:=proc(n) local t1, k; t1:=1; for k from 0 to n do t1:=lcm(t1, denom(C(n, k))); od: t1; end;

MATHEMATICA

cn[n_, 0] := Sum[ n^j*StirlingS1[n, j]/(j+1), {j, 1, n+1}]/n!; cn[n_, n_] := cn[n, 0]; cn[n_, k_] := 1/n!*Binomial[n, k]*Sum[n^(j+m)*StirlingS1[k, j]* StirlingS1[n-k, m]/((m+1)*Binomial[j+m+1, m+1]), {m, 1, n}, {j, 1, k+1}]; a[n_] := LCM @@ Table[ Denominator[cn[n, k]], {k, 0, n}]; Table[a[n], {n, 1, 21}] (* From Jean-François Alcover, Oct 25 2011 *)

PROG

(PARI) cn(n)= mattranspose(matinverseimage( matrix(n+1, n+1, k, m, (m-1)^(k-1)), matrix(n+1, 1, k, m, n^(k-1)/k)))[ 1, ] \\ vector of quadrature formula coefficients via matrix solution

(PARI) A002176(n)= denominator(cn(n))

CROSSREFS

Cf. A002177-A002179, A100620, A100621, A100640, A100641, A100642.

Sequence in context: A075998 A007849 A100621 * A124675 A120709 A002689

Adjacent sequences:  A002173 A002174 A002175 * A002177 A002178 A002179

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms and references from Michael Somos

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.