|
|
A104602
|
|
Number of square (0,1)-matrices with exactly n entries equal to 1 and no zero row or columns.
|
|
21
|
|
|
1, 1, 2, 10, 70, 642, 7246, 97052, 1503700, 26448872, 520556146, 11333475922, 270422904986, 7016943483450, 196717253145470, 5925211960335162, 190825629733950454, 6543503207678564364, 238019066600097607402, 9153956822981328930170, 371126108428565106918404
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of square (0,1)-matrices with exactly n entries equal to 1 and no zero row or columns, up to row and column permutation, is A057151(n). - Vladeta Jovovic, Mar 25 2006
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{n>=0} Sum_{j=0..n} (-1)^(n-j)*binomial(n,j)*((1+x)^j-1)^n. - Vladeta Jovovic, Mar 25 2006
a(n) ~ c * n! / (sqrt(n) * (log(2))^(2*n)), where c = 0.28889864564457451375789435201798... . - Vaclav Kotesovec, May 07 2014
In closed form, c = 1 / (log(2) * 2^(log(2)/2+2) * sqrt(Pi*(1-log(2)))). - Vaclav Kotesovec, May 03 2015
G.f.: Sum_{n>=0} ((1+x)^n - 1)^n / (1+x)^(n*(n+1)). - Paul D. Hanna, Mar 26 2018
|
|
EXAMPLE
|
The a(3) = 10 matrices:
[1 1] [1 1] [1 0] [0 1]
[1 0] [0 1] [1 1] [1 1]
.
[1 0 0] [1 0 0] [0 1 0] [0 1 0] [0 0 1] [0 0 1]
[0 1 0] [0 0 1] [1 0 0] [0 0 1] [1 0 0] [0 1 0]
[0 0 1] [0 1 0] [0 0 1] [1 0 0] [0 1 0] [1 0 0]
(End)
|
|
MATHEMATICA
|
Table[1/n!*Sum[StirlingS1[n, k]*Sum[(m!)^2*StirlingS2[k, m]^2, {m, 0, k}], {k, 0, n}], {n, 1, 20}] (* Vaclav Kotesovec, May 07 2014 *)
Table[Length[Select[Subsets[Tuples[Range[n], 2], {n}], Union[First/@#]==Union[Last/@#]==Range[Max@@First/@#]&]], {n, 5}] (* Gus Wiseman, Nov 14 2018 *)
|
|
CROSSREFS
|
Cf. A048291, A049311, A054976, A057150, A057151, A101370, A120732, A120733, A138178, A316983, A319616.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|