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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141681 Triangle sequence of coefficients: t(n,m)=Inverse[A126988(n,m)*Binomial(n,m)]. 0
1, -4, 1, -9, 0, 1, 32, -12, 0, 1, -25, 0, 0, 0, 1, 504, -45, -40, 0, 0, 1, -49, 0, 0, 0, 0, 0, 1, -4096, 1568, 0, -140, 0, 0, 0, 1, 2187, 0, -252, 0, 0, 0, 0, 0, 1, 13400, -225, 0, 0, -504, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Row sums are:

{1, -3, -8, 21, -24, 420, -48, -2667, 1936, 12672}.

FORMULA

t(n,m)=Inverse[A126988(n,m)*Binomial(n,m)].

EXAMPLE

{1},

{-4, 1},

{-9, 0, 1},

{32, -12, 0, 1},

{-25, 0, 0, 0, 1},

{504, -45, -40, 0, 0, 1},

{-49, 0, 0, 0, 0, 0, 1},

{-4096, 1568, 0, -140, 0, 0, 0,1},

{2187, 0, -252, 0, 0, 0, 0,0, 1},

{13400, -225, 0, 0, -504, 0, 0, 0, 0, 1}

MATHEMATICA

t[n_, m_] = If[Mod[n, m] == 0, n/m, 0]*Binomial[n, m]; Table[Table[t[n, m], {m, 1, n}], {n, 1, 10}]; Flatten[%]; Table[Sum[t[n, m], {m, 1, n}], {n, 1, 10}]; M = Inverse[Table[Table[t[n, m], {m, 1, 10}], {n, 1, 10}]]; Table[Table[M[[n, m]], {m, 1, n}], {n, 1, 10}]; Flatten[%]

CROSSREFS

Cf. A126988.

Sequence in context: A036177 A177841 A141680 * A176215 A143469 A123726

Adjacent sequences:  A141678 A141679 A141680 * A141682 A141683 A141684

KEYWORD

uned,sign

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 07 2008

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 00:09 EST 2012. Contains 205978 sequences.