A001071
Number of one-sided chessboard polyominoes with n cells.
Original entry on oeis.org
2, 1, 4, 10, 36, 108, 392, 1363, 5000, 18223, 67792, 252938, 952540, 3602478, 13699554, 52296713, 200406388, 770411478, 2970401696, 11482395526, 44491881090, 172766311857, 672186650116
Offset: 1
- W. F. Lunnon, personal communication.
- N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A331621
Number of distinct structures that can be made from n cubes without overhangs.
Original entry on oeis.org
1, 1, 2, 4, 12, 35, 129, 495, 2101, 9154, 41356, 189466, 880156, 4120515, 19425037, 92038062, 438030079, 2092403558, 10027947217, 48198234188, 232261124908, 1121853426115, 5430222591596
Offset: 0
For n = 0, one (the empty) structure is possible.
For n = 1, only one structure is possible, a single cube.
For n = 2, two structures are possible: two cubes one on top of the other, and two next to each other.
For n = 3, four structures are possible: an L shape with the L oriented vertically, an L shape with the L laid flat, a structure with 3 cubes stacked on top of each other and a structure with 3 cubes laid flat.
For n = 4, there are 12 possible distinct structures made from 4 cubes without overhangs. These include 1 structure that is 4 cubes tall, 1 structure that is 3 cubes tall, 5 structures that are 2 cubes tall and 5 that are 1 cube tall.
Extension to the third dimension of
A000105.
Comments