login
A298426
Regular triangle where T(n,k) is number of k-ary rooted trees with n nodes.
18
1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 2, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 3, 0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 6, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 11, 4, 2, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 23, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1
OFFSET
1,24
COMMENTS
Row sums are A298422.
LINKS
EXAMPLE
Triangle begins:
1
0 1
0 1 1
0 1 0 1
0 1 1 0 1
0 1 0 0 0 1
0 1 2 1 0 0 1
0 1 0 0 0 0 0 1
0 1 3 0 1 0 0 0 1
0 1 0 2 0 0 0 0 0 1
0 1 6 0 0 1 0 0 0 0 1
0 1 0 0 0 0 0 0 0 0 0 1
0 1 11 4 2 0 1 0 0 0 0 0 1
0 1 0 0 0 0 0 0 0 0 0 0 0 1
0 1 23 0 0 0 0 1 0 0 0 0 0 0 1
0 1 0 8 0 2 0 0 0 0 0 0 0 0 0 1
MATHEMATICA
nn=16;
arut[n_, k_]:=If[n===1, {{}}, Join@@Function[c, Union[Sort/@Tuples[arut[#, k]&/@c]]]/@Select[IntegerPartitions[n-1], Length[#]===k&]]
Table[arut[n, k]//Length, {n, nn}, {k, 0, n-1}]
KEYWORD
nonn,tabl
AUTHOR
Gus Wiseman, Jan 19 2018
STATUS
approved