A378015 Triangle read by rows: T(n,k) = number of free hexagonal polyominoes with n cells, where the maximum number of collinear cell centers on any line in the plane is k.
1, 0, 1, 0, 2, 1, 0, 4, 2, 1, 0, 2, 16, 3, 1, 0, 3, 52, 23, 3, 1, 0, 0, 169, 129, 30, 4, 1, 0, 0, 477, 740, 187, 39, 4, 1, 0, 0, 1245, 3729, 1274, 270, 48, 5, 1, 0, 0, 2750, 17578, 7785, 1948, 364, 59, 5, 1, 0, 0, 5380, 75827, 46045, 12895, 2840, 488, 70, 6, 1
Offset: 1
Examples
| k n | 1 2 3 4 5 6 7 8 9 10 Total --------------------------------------------------------------------------------------- 1 | 1 1 2 | 0 1 1 3 | 0 2 1 3 4 | 0 4 2 1 7 5 | 0 2 16 3 1 22 6 | 0 3 52 23 3 1 82 7 | 0 0 169 129 30 4 1 333 8 | 0 0 477 740 187 39 4 1 1448 9 | 0 0 1245 3729 1274 270 48 5 1 6572 10 | 0 0 2750 17578 7785 1948 364 59 5 1 30490 The T(5,2)=2 hexagon polyominoes are: # # # # # # # # # #
Links
- Dave Budd, Python code for a hex lattice.
Comments