|
|
A365566
|
|
Triangle read by rows: T(n,d) is the number of inequivalent properly d-dimensional n-polysticks (or polyedges), 1 <= d <= n.
|
|
4
|
|
|
1, 1, 1, 1, 4, 2, 1, 15, 12, 3, 1, 54, 105, 39, 6, 1, 221, 863, 566, 117, 11
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|