%I #4 Sep 09 2023 11:26:07

%S 1,1,1,1,4,2,1,15,12,3,1,54,105,39,6,1,221,863,566,117,11

%N Triangle read by rows: T(n,d) is the number of inequivalent properly d-dimensional n-polysticks (or polyedges), 1 <= d <= n.

%H <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>.

%F T(n,n) = A000055(n+1).

%e Triangle begins:

%e n\d | 1 2 3 4 5 6

%e ----+---------------------

%e 1 | 1

%e 2 | 1 1

%e 3 | 1 4 2

%e 4 | 1 15 12 3

%e 5 | 1 54 105 39 6

%e 6 | 1 221 863 566 117 11

%Y Cf. A000055, A049430, A365565 (row sums).

%K nonn,tabl,hard,more

%O 1,5

%A _Pontus von Brömssen_, Sep 09 2023