Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134645
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134645 Number of m X n (-1,0,1)-matrices with every row sum 3 and column sum 2. +0
2
7, 16260, 747558000, 250071339672000, 369820640830881240000 (list; graph; listen)
OFFSET

2,1

REFERENCES

Zhonghua Tan and Shanzhen Gao,Counting (0,1,2)- Matrices, submitted

FORMULA

t(m,n)=6^{-m} sum_{i=0}^{m}frac{3^{i}m!n!(2n-2i)!}{% i!(m-i)!(n-i)!2^{n-i}}

CROSSREFS

Cf. A000681.

Adjacent sequences: A134642 A134643 A134644 this_sequence A134646 A134647 A134648

Sequence in context: A067248 A152007 A131676 this_sequence A115997 A013786 A072050

KEYWORD

nonn

AUTHOR

Shanzhen Gao (sgao2(AT)fau.edu), Nov 05 2007

EXTENSIONS

Perhaps "Number of n X n+1 (-1,0,1)-matrices ..." ? - njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research