|
%I #27 May 29 2021 07:04:43
%S 16,56,176,388,822,1452,2516,3952,6060,8736,12492,17040,23102,30280,
%T 39234,49688,62730,77556,95642,115992,139874,166560,197992,232600,
%U 272574,316460,366390,420792,482748,549516,624962,706436,796766,893844,1001074,1115428
%N Column 2 of triangle in A288187.
%C For the graphs defined in A331452 and A288187 only the counts for graphs that are one square wide have formulas for regions, edges, and vertices (see A306302, A331757, A331755). For width 2 there are six such sequences (A331766, A331765, A331763; A333279, A333280, A333281). It would be nice to have a formula for any one of them.
%C The maximum number of edges over all chambers is 4 for 1 <= n <= 4 and 5 for 5 <= n <= 160. - _Lars Blomberg_, May 23 2021
%H Lars Blomberg, <a href="/A333279/b333279.txt">Table of n, a(n) for n = 1..200</a>
%H Lars Blomberg, <a href="/A333279/a333279.png">Colored illustration of a(1)</a>
%H Lars Blomberg, <a href="/A333279/a333279_1.png">Colored illustration of a(2)</a>
%H Lars Blomberg, <a href="/A333279/a333279_2.png">Colored illustration of a(3)</a>
%H Lars Blomberg, <a href="/A333279/a333279_3.png">Colored illustration of a(4)</a>
%H Lars Blomberg, <a href="/A333279/a333279_4.png">Colored illustration of a(5)</a>
%H Lars Blomberg, <a href="/A333279/a333279_5.png">Colored illustration of a(6)</a>
%H Lars Blomberg, <a href="/A333279/a333279_6.png">Colored illustration of a(7)</a>
%H Lars Blomberg, <a href="/A333279/a333279_7.png">Colored illustration of a(8)</a>
%H Lars Blomberg, <a href="/A333279/a333279_8.png">Colored illustration of a(9)</a>
%H Hugo Pfoertner, <a href="/A288177/a288177.pdf">Illustrations of Chamber Complexes up to 5 X 5</a>.
%Y Cf. A331452, A288187; A331766, A331765, A331763; A333279, A333280, A333281.
%K nonn
%O 1,1
%A _Scott R. Shannon_ and _N. J. A. Sloane_, Mar 15 2020
%E a(10) and beyond from _Lars Blomberg_, May 23 2021
|
