|
Search: id:A062156
|
|
|
| A062156 |
|
Number of n X n matrices over {0,1,2} with all row and column sums equal to 1 or 2. |
|
+0
3
|
|
| 1, 2, 13, 189, 4842, 190080, 10520010, 777018690, 73646397720, 8696221929360, 1249994376199800, 214673857998276600, 43377963701592920400, 10180798532673708139200, 2745082427076790292091600
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983,(Problem 3.4.15).
|
|
EXAMPLE
|
There are 13 2 X 2 matrices over {0,1,2} with all row and column sums equal to 1 or 2, cf. A062154.
|
|
CROSSREFS
|
Cf. A062154, A062155.
Sequence in context: A119400 A137610 A073178 this_sequence A049512 A003507 A003085
Adjacent sequences: A062153 A062154 A062155 this_sequence A062157 A062158 A062159
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 06 2001
|
|
|
Search completed in 0.002 seconds
|
