A231145 Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 5 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=n-n%2, read by rows.
1, 2, 2, 1, 2, 4, 1, 4, 13, 10, 4, 1, 4, 23, 35, 23, 1, 6, 40, 101, 125, 54, 10, 1, 6, 58, 206, 403, 336, 106, 1, 8, 83, 392, 1056, 1438, 956, 240, 25, 1, 8, 109, 641, 2281, 4424, 4718, 2409, 473, 1, 10, 142, 1011, 4429, 11370, 17252, 14478, 6094, 1020, 70
Offset: 2
Examples
The first 8 rows of T(n,k) are: .\ k 0 1 2 3 4 5 6 7 8 n 2 1 2 2 3 1 2 4 4 1 4 13 10 4 5 1 4 23 35 23 6 1 6 40 101 125 54 10 7 1 6 58 206 403 336 106 8 1 8 83 392 1056 1438 956 240 25 9 1 8 109 641 2281 4424 4718 2409 473
Links
- Andrew Howroyd, Table of n, a(n) for n = 2..967 (terms n=2..71 from Christopher Hunt Gribble)
- Christopher Hunt Gribble, C++ program
Crossrefs
Extensions
Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 26 2015