|
%I #14 Oct 25 2019 17:19:21
%S 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,
%T 0,0,0,24,864,3672,1152,16,0,0,0,0,432,9072,18336,3584,32,0,0,0,0,0,
%U 8304,65664,69472,7424,32,0,0,0,0,0,2880,109152,484416,313856,22592,64
%N 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).
%C See A146304 for algorithm and PARI code to produce this sequence.
%C Equivalently, the coefficients of the maximal independent set polynomials on the n X n white bishop graph.
%C The product of the first nonzero term in each row of this sequence and that of A288183 give A122749.
%H Andrew Howroyd, <a href="/A288182/b288182.txt">Table of n, a(n) for n = 2..1276</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WhiteBishopGraph.html">White Bishop Graph</a>
%e Triangle starts (first term is n=2, k=1):
%e 2;
%e 0, 2;
%e 0, 4, 4;
%e 0, 2, 16, 4;
%e 0, 0, 16, 64, 8;
%e 0, 0, 0, 128, 160, 8;
%e 0, 0, 0, 72, 784, 528, 16;
%e 0, 0, 0, 24, 864, 3672, 1152, 16;
%e 0, 0, 0, 0, 432, 9072, 18336, 3584, 32;
%e 0, 0, 0, 0, 0, 8304, 65664, 69472, 7424, 32;
%e ...
%Y Row sums are A290613.
%Y Cf. A288183, A122749, A274106, A146304.
%K nonn,tabl
%O 2,1
%A _Andrew Howroyd_, Jun 06 2017
|
