login
A333288
Triangle read by rows: consider a figure made up of a row of n congruent rectangles and the diagonals of all visible rectangles; T(n,k) (1 <= k <= n) is the number of regions in the k-th rectangle.
11
4, 8, 8, 12, 22, 12, 16, 36, 36, 16, 20, 52, 70, 52, 20, 24, 66, 100, 100, 66, 24, 28, 82, 134, 160, 134, 82, 28, 32, 98, 166, 218, 218, 166, 98, 32, 36, 116, 198, 276, 310, 276, 198, 116, 36, 40, 134, 230, 328, 396, 396, 328, 230, 134, 40, 44, 154, 266, 386
OFFSET
1,1
COMMENTS
This was originally based on the data in Jinyuan Wang's A324042, and then extended by Lars Blomberg.
Since the cells are either triangles or quadrilaterals, this is the sum of the two arrays A333286 and A333287.
It would be nice to have a formula for these entries. It is easy to see that the first column is 4n for n>=1.
LINKS
Lars Blomberg, Scott R. Shannon and N. J. A. Sloane, Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids, (2021). Also arXiv:2009.07918.
EXAMPLE
Triangle begins:
4;
8, 8;
12, 22, 12;
16, 36, 36, 16;
20, 52, 70, 52, 20;
24, 66, 100, 100, 66, 24;
28, 82, 134, 160, 134, 82, 28;
...
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Mar 20 2020
EXTENSIONS
a(29) and beyond from Lars Blomberg, Apr 23 2020
STATUS
approved