|
|
A375566
|
|
Array read by antidiagonals: T(m,n) = number of minimum dominating sets in the stacked prism graph C_m X P_n.
|
|
2
|
|
|
1, 2, 2, 1, 6, 3, 4, 3, 9, 6, 3, 12, 34, 4, 5, 1, 2, 123, 4, 10, 3, 8, 17, 3, 16, 5, 51, 14, 4, 2, 18, 28, 290, 18, 14, 8, 1, 20, 93, 76, 320, 6, 63, 4, 3, 13, 2, 438, 164, 265, 171, 14, 4, 18, 25, 5, 24, 3, 396, 255, 36, 91, 24, 9, 120, 11, 1, 2, 27, 904, 250, 6, 1526, 60, 2052, 25, 22, 3
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Table starts:
====================================
m\n | 1 2 3 4 5 6 ...
----+-------------------------------
1 | 1 2 1 4 3 1 ...
2 | 2 6 3 12 2 17 ...
3 | 3 9 34 123 3 18 ...
4 | 6 4 4 16 28 76 ...
5 | 5 10 5 290 320 265 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|