A365559
Number of free n-polysticks (or polyedges) in 3 dimensions.
Original entry on oeis.org
1, 2, 7, 28, 160, 1085, 8403, 69824, 607988, 5448444, 49846437, 462977928
Offset: 1
There are a(3) = 7 free 3-polysticks in 3 dimensions: A019988(3) = 5 properly 1- or 2-dimensional (straight, "U", "T", "L", and skew, similar to the 5 tetrominoes) and 2 properly 3-dimensional (one path-like and one with a vertex of degree 3).
Sum of first three columns of
A365566.
a(11) derived from Ishino Keiichiro's website (sum of 2-sided 2D-edges and 3D-edges), added by
Pontus von Brömssen, Dec 21 2023
A365561
Number of free n-polysticks (or polyedges) in 4 dimensions.
Original entry on oeis.org
1, 2, 7, 31, 199, 1651, 16648
Offset: 1
Sum of first four columns of
A365566.
A365566
Triangle read by rows: T(n,d) is the number of inequivalent properly d-dimensional n-polysticks (or polyedges), 1 <= d <= n.
Original entry on oeis.org
1, 1, 1, 1, 4, 2, 1, 15, 12, 3, 1, 54, 105, 39, 6, 1, 221, 863, 566, 117, 11
Offset: 1
Triangle begins:
n\d | 1 2 3 4 5 6
----+---------------------
1 | 1
2 | 1 1
3 | 1 4 2
4 | 1 15 12 3
5 | 1 54 105 39 6
6 | 1 221 863 566 117 11
A365563
Number of free n-polysticks (or polyedges) in 5 dimensions.
Original entry on oeis.org
1, 2, 7, 31, 205, 1768
Offset: 1
Sum of first five columns of
A365566.
A385583
Triangle read by rows: T(n,d) is the number of free d-dimensional polysticks of size n.
Original entry on oeis.org
1, 1, 2, 1, 5, 7, 1, 16, 28, 31, 1, 55, 160, 199, 205, 1, 222, 1085, 1651, 1768, 1779
Offset: 1
Triangle begins:
n\d| 1 2 3 4 5 6
---+--------------------------
1 | 1
2 | 1 2
3 | 1 5 7
4 | 1 16 28 31
5 | 1 55 160 199 205
6 | 1 222 1085 1651 1768 1779
A387005
Number of free (d,2)-polyominoids of size n in arbitrary dimension d.
Original entry on oeis.org
Showing 1-6 of 6 results.
Comments