A238583 Number T(n,k) of equivalence classes of ways of placing k 4 X 4 tiles in an n X 9 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=4, 0<=k<=2*floor(n/4), read by rows.
1, 3, 2, 1, 3, 4, 1, 6, 9, 1, 6, 14, 1, 9, 32, 18, 4, 1, 9, 55, 65, 23, 1, 12, 91, 164, 87, 1, 12, 132, 320, 229, 1, 15, 186, 608, 648, 134, 10, 1, 15, 245, 1043, 1633, 770, 106, 1, 18, 317, 1736, 3659, 2800, 646, 1, 18, 394, 2666, 7247, 7572, 2510
Offset: 4
Examples
The first 8 rows of T(n,k) are: .\ k 0 1 2 3 4 n 4 1 3 2 5 1 3 4 6 1 6 9 7 1 6 14 8 1 9 32 18 4 9 1 9 55 65 23 10 1 12 91 164 87 11 1 12 132 320 229
Links
- Andrew Howroyd, Table of n, a(n) for n = 4..992
- Christopher Hunt Gribble, C++ program
Crossrefs
Extensions
Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015
Terms a(26) and beyond from Andrew Howroyd, May 29 2017