cp's OEIS Frontend

A293177 Triangle read by rows: T(m,n) = number of maximal independent sets in m X n rectangular grid graph (m>=1, 1<=n<=m).

%I A293177 #17 Feb 16 2025 08:33:51
%S A293177 1,2,2,2,4,10,3,6,18,42,4,10,38,108,358,5,16,78,274,1132,4468,7,26,
%T A293177 156,692,3580,17742,88056,9,42,320,1754,11382,70616,439338,2745186,12,
%U A293177 68,654,4442,36270,281202,2192602,17155374,16,110,1326,11248,114992,1117442,10912392,106972582
%N A293177 Triangle read by rows: T(m,n) = number of maximal independent sets in m X n rectangular grid graph (m>=1, 1<=n<=m).
%H A293177 Oh, Seungsang. "Maximal independent sets on a grid graph." Discrete Mathematics 340.12 (2017): 2762-2768. Also <a href="http://arxiv.org/abs/1709.03678">arXiv:1709.03678</a>.
%H A293177 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%H A293177 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%e A293177 Triangle begins:
%e A293177 1,
%e A293177 2,2,
%e A293177 2,4,10,
%e A293177 3,6,18,42,
%e A293177 4,10,38,108,358,
%e A293177 5,16,78,274,1132,4468,
%e A293177 7,26,156,692,3580,17742,88056,
%e A293177 9,42,320,1754,11382,70616,439338,2745186,
%e A293177 12,68,654,4442,36270,281202,2192602,17155374,
%e A293177 16,110,1326,11248,114992,1117442,10912392,106972582,
%e A293177 ...
%Y A293177 Main diagonal is A197048.
%Y A293177 Rows 3,4,5,6,... form the beginnings of A197049, A197050, A197051, A197052, ..., respectively.
%Y A293177 Triangular version of A197054.
%K A293177 nonn,tabl
%O A293177 1,2
%A A293177 _N. J. A. Sloane_, Oct 19 2017