OFFSET
1,6
REFERENCES
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
LINKS
R. W. Robinson, Rows 1 through 30, flattened
EXAMPLE
K M N gives the number N of unlabeled rooted bicolored trees in which K nodes have even distance from the root and M nodes have odd distance from the root.
1 0 1
Total( 1) = 1
1 1 1
Total( 2) = 1
1 2 1
2 1 1
Total( 3) = 2
1 3 1
2 2 2
3 1 1
Total( 4) = 4
1 4 1
2 3 3
3 2 4
4 1 1
Total( 5) = 9
1 5 1
2 4 4
3 3 9
4 2 5
5 1 1
Total( 6) = 20
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
N. J. A. Sloane, Oct 19 2006
STATUS
approved