|
|
A232833
|
|
Triangle read by rows: T(n,k) = number of n X n binary matrices with k pairwise nonadjacent 1's, n >= 0, k = 0..n^2.
|
|
13
|
|
|
1, 1, 1, 1, 4, 2, 0, 0, 1, 9, 24, 22, 6, 1, 0, 0, 0, 0, 1, 16, 96, 276, 405, 304, 114, 20, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 25, 260, 1474, 5024, 10741, 14650, 12798, 7157, 2578, 618, 106, 14, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 36, 570, 5248, 31320, 127960, 368868
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
Also number of ways to place k non-attacking wazirs on an n X n board.
Two matrix elements are considered adjacent if the difference of their row indices is 1 and the column indices are equal, or vice versa (von Neumann neighborhood).
If only non-equivalent (mod D_4) matrices are counted, the corresponding numbers are given by A232569.
Rows with trailing zeros dropped give the coefficients of the independence polynomial for the n X n grid graph. - Eric W. Weisstein, May 31 2017
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1;
1, 4, 2, 0, 0;
1, 9, 24, 22, 6, 1, 0, 0, 0, 0;
1, 16, 96, 276, 405, 304, 114, 20, 2, 0, 0, 0, 0, 0, 0, 0, 0;
...
|
|
MAPLE
|
b:= proc(n, l) option remember; local k;
if n=0 then 1
elif min(l)>0 then b(n-1, map(x-> x-1, l))
else for k while l[k]>0 do od;
b(n, subsop(k=1, l))+expand(x*`if`(n>0, `if`(k<nops(l),
b(n, subsop(k=2, k+1=1, l)), b(n, subsop(k=2, l))), 0))
fi
end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n^2))(b(n, [0$n])):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|