Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 May 11 2017 12:26:15
%S 1,1,3,1,7,4,1,17,13,7,1,41,43,35,11,1,99,142,181,81,18,1,239,469,933,
%T 621,199,29,1,577,1549,4811,4741,2309,477,47,1,1393,5116,24807,36211,
%U 26660,8303,1155,76,1,3363,16897,127913,276561,307983,143697,30277,2785,123
%N Array read by antidiagonals: T(m,n) = number of independent sets in the cylinder graph C_m X P_n.
%C Equivalently, the number of vertex covers in the cylinder graph C_m X P_n.
%H Andrew Howroyd, <a href="/A286513/b286513.txt">Table of n, a(n) for n = 1..435</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependentVertexSet.html">Independent Vertex Set</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Independent_set_(graph_theory)">Independent set</a>
%e Table starts:
%e =============================================================
%e m\n| 1 2 3 4 5 6 7
%e ---|---------------------------------------------------------
%e 1 | 1 1 1 1 1 1 1 ...
%e 2 | 3 7 17 41 99 239 577 ...
%e 3 | 4 13 43 142 469 1549 5116 ...
%e 4 | 7 35 181 933 4811 24807 127913 ...
%e 5 | 11 81 621 4741 36211 276561 2112241 ...
%e 6 | 18 199 2309 26660 307983 3557711 41097664 ...
%e 7 | 29 477 8303 143697 2488431 43089985 746156517 ...
%e 8 | 47 1155 30277 788453 20546803 535404487 13951571713 ...
%e ...
%Y Rows 3-8 are A003688(n+1), A051926, A181989, A181961, A182014, A182019.
%Y Columns 1-4 are A000032, A051927, A050400, A050401.
%Y Main diagonal is A212270.
%Y Cf. A089934 (P_m X P_n), A027683, A286514.
%K nonn,tabl
%O 1,3
%A _Andrew Howroyd_, May 10 2017