

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).


0



1, 2, 2, 2, 4, 10, 3, 6, 18, 42, 4, 10, 38, 108, 358, 5, 16, 78, 274, 1132, 4468, 7, 26, 156, 692, 3580, 17742, 88056, 9, 42, 320, 1754, 11382, 70616, 439338, 2745186, 12, 68, 654, 4442, 36270, 281202, 2192602, 17155374, 16, 110, 1326, 11248, 114992, 1117442, 10912392, 106972582
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Oh, Seungsang. "Maximal independent sets on a grid graph." Discrete Mathematics 340.12 (2017): 27622768. Also arXiv:1709.03678.


EXAMPLE

Triangle begins:
1,
2,2,
2,4,10,
3,6,18,42,
4,10,38,108,358,
5,16,78,274,1132,4468,
7,26,156,692,3580,17742,88056,
9,42,320,1754,11382,70616,439338,2745186,
12,68,654,4442,36270,281202,2192602,17155374,
16,110,1326,11248,114992,1117442,10912392,106972582,
...


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



