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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140925 Binomial(m+n-1,n)^2-binomial(m+n,n+1)*binomial(m+n-2,n-1) with m=12. 4
1, 66, 1716, 26026, 273273, 2186184, 14158144, 77364144, 367479684, 1551580888, 5924217936, 20734762776, 67255063876, 203982391536, 582806832960, 1578435172600, 4073755482225, 10064572367850, 23896002230100, 54709268263650, 121141951155225, 260114319363600 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Number of 2 X 10 matrices with elements in 0..n with each row and each column in nondecreasing order. 2,10,n can be permuted, see formula.

REFERENCES

S. Mukai, An Introduction to Invariants and Moduli, Cambridge, 2003; Prop. 8.4, case n=12. - N. J. A. Sloane, Aug 28 2010.

FORMULA

(Empirical) set p,q,r to n,10,2 (in any order) in s=p+q+r-1; a(n) = product {i in 0..r-1} (binomial(s,p+i)*i!/(s-i)^(r-i-1))

CROSSREFS

Sequence in context: A104673 A133318 A197645 * A017782 A035728 A114252

Adjacent sequences:  A140922 A140923 A140924 * A140926 A140927 A140928

KEYWORD

nonn

AUTHOR

R. H. Hardin rhh(at)cadence.com, Jul 05 2008

EXTENSIONS

Edited by N. J. A. Sloane, Aug 28 2010.

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 07:41 EST 2012. Contains 205998 sequences.