|
|
A369178
|
|
Irregular table read by rows: T(n,k) is the number of k-sided regions, k>=3, in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row.
|
|
4
|
|
|
2, 8, 4, 22, 14, 52, 34, 98, 82, 184, 146, 302, 268, 484, 426, 8, 710, 694, 4, 1064, 986, 8, 1498, 1436, 12, 2056, 1986, 12, 2710, 2780, 12, 3624, 3630, 24, 4682, 4728, 20, 6012, 5970, 24, 7518, 7628, 28, 9408, 9406, 32, 11526, 11702, 40, 14028, 14246, 64, 16782, 17330, 60
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Unlike the graph in A306302, or the complete bipartite graph of order n, for n>=8 the graph contains regions with 5 edges. It is likely 5 is the maximum number of edges in any region for all n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The table begins:
2;
8, 4;
22, 14;
52, 34;
98, 82;
184, 146;
302, 268;
484, 426, 8;
710, 694, 4;
1064, 986, 8;
1498, 1436, 12;
2056, 1986, 12;
2710, 2780, 12;
3624, 3630, 24;
4682, 4728, 20;
6012, 5970, 24;
7518, 7628, 28;
9408, 9406, 32;
11526, 11702, 40;
14028, 14246, 64;
16782, 17330, 60;
20220, 20518, 68;
23998, 24468, 80;
28304, 28786, 84;
.
.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|