|
|
A288182
|
|
Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the white squares of an n X n board with every square controlled by at least one bishop (1<=k<n).
|
|
5
|
|
|
2, 0, 2, 0, 4, 4, 0, 2, 16, 4, 0, 0, 16, 64, 8, 0, 0, 0, 128, 160, 8, 0, 0, 0, 72, 784, 528, 16, 0, 0, 0, 24, 864, 3672, 1152, 16, 0, 0, 0, 0, 432, 9072, 18336, 3584, 32, 0, 0, 0, 0, 0, 8304, 65664, 69472, 7424, 32, 0, 0, 0, 0, 0, 2880, 109152, 484416, 313856, 22592, 64
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
See A146304 for algorithm and PARI code to produce this sequence.
Equivalently, the coefficients of the maximal independent set polynomials on the n X n white bishop graph.
The product of the first nonzero term in each row of this sequence and that of A288183 give A122749.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle starts (first term is n=2, k=1):
2;
0, 2;
0, 4, 4;
0, 2, 16, 4;
0, 0, 16, 64, 8;
0, 0, 0, 128, 160, 8;
0, 0, 0, 72, 784, 528, 16;
0, 0, 0, 24, 864, 3672, 1152, 16;
0, 0, 0, 0, 432, 9072, 18336, 3584, 32;
0, 0, 0, 0, 0, 8304, 65664, 69472, 7424, 32;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|