The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336731 Three-column table read by rows: row n gives [number of triangle-triangle, triangle-quadrilateral, quadrilateral-quadrilateral] contacts for a row of n adjacent congruent rectangles divided by drawing diagonals of all possible rectangles (cf. A331452). 2

%I #30 Aug 03 2020 10:05:11

%S 4,0,0,14,8,0,20,48,4,60,80,28,68,224,68,148,368,124,224,616,268,336,

%T 1008,420,384,1672,648,712,2208,972,972,3120,1464,1300,4304,1996,1496,

%U 6040,2788,2044,7936,3580,2612,10224,4672,3540,12656,5980,4224,16104,7676,5484,19648,9500

%N Three-column table read by rows: row n gives [number of triangle-triangle, triangle-quadrilateral, quadrilateral-quadrilateral] contacts for a row of n adjacent congruent rectangles divided by drawing diagonals of all possible rectangles (cf. A331452).

%C For a row of n adjacent rectangles the only polygons formed when dividing all possible rectangles along their diagonals are 3-gons (triangles) and 4-gons (quadrilaterals). Hence the only possible edge-sharing contacts are 3-gons with 3-gons, 3-gons with 4-gons, and 4-gons with 4-gons. This sequence lists the number of these three possible combinations for a row of n adjacent rectangles. Note that the edges along the outside of the n adjacent rectangles are not counted as they are only in one n-gon.

%C These are graphs T(1,n) described in A331452. - _N. J. A. Sloane_, Aug 03 2020

%H Scott R. Shannon, <a href="/A336731/a336731_3.png">Image of the rectangles for n = 1</a>.

%H Scott R. Shannon, <a href="/A336731/a336731.png">Image of the rectangles for n = 2</a>.

%H Scott R. Shannon, <a href="/A336731/a336731_1.png">Image of the rectangles for n = 3</a>.

%H Scott R. Shannon, <a href="/A336731/a336731_2.png">Image of the rectangles for n = 4</a>.

%F Sum of row t = A331757(t) - 2(t + 1).

%e a(1) = 4, a(2) = 0, a(3) = 0. A single rectangle divided along its diagonals consists of four 3-gons, four edges, and no 4-gons. Therefore there are only four 3-gon-to-3-gon contacts. See the link image for n = 1.

%e a(4) = 14, a(5) = 8, a(6) = 0. Two adjacent rectangles divided along all diagonals consists of fourteen 3-gons and two 4-gons. The two 4-gons are separated and thus share all their edges, eight in total, with 3-gons. There are fourteen pairs of 3-gon-to-3-gon contacts. See the link image for n = 2.

%e a(7) = 20, a(8) = 48, a(9) = 4. Three adjacent rectangles divided along all diagonals consists of thirty-two 3-gons and fourteen 4-gons. There are two groups of three adjacent 4-gons, so there are four 4-gons-to-4-gon contacts. These, along with the other 4-gons, share 48 edges with 3-gons. There are also twenty 3-gon-to-3-gon contacts. See the link image for n = 3.

%e .

%e The table begins:

%e 4,0,0;

%e 14,8,0;

%e 20,48,4;

%e 60,80,28;

%e 68,224,68;

%e 148,368,124;

%e 224,616,268;

%e 336,1008,420;

%e 384,1672,648;

%e 712,2208,972;

%e 972,3120,1464;

%e 1300,4304,1996;

%e 1496,6040,2788;

%e 2044,7936,3580;

%e 2612,10224,4672;

%e 3540,12656,5980;

%e 4224,16104,7676;

%e 5484,19648,9500;

%e 6568,24216,11936;

%e 7836,29616,14468;

%e See A306302 for a count of the regions and images for other values of n.

%Y Cf. A306302, A331452, A331755, A331757, A333288.

%K nonn,tabf

%O 1,1

%A _Scott R. Shannon_, Aug 02 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 04:27 EDT 2024. Contains 373102 sequences. (Running on oeis4.)