Triangular array read by rows. T(n,k) is the number of labeled rooted trees of height at most 2 with exactly k leaves at a distance 1 from the root, n>=1, 0<=k<=n-1.

A220233

Triangular array read by rows. T(n,k) is the number of labeled rooted trees of height at most 2 with exactly k leaves at a distance 1 from the root, n>=1, 0<=k<=n-1.

Terms

    a(0) =0a(1) =0a(2) =2a(3) =6a(4) =0a(5) =3a(6) =12a(7) =24a(8) =0a(9) =4a(10) =80a(11) =60a(12) =60a(13) =0a(14) =5a(15) =390a(16) =480a(17) =180a(18) =120a(19) =0a(20) =6a(21) =2352a(22) =2730a(23) =1680a(24) =420a(25) =210a(26) =0a(27) =7a(28) =15176a(29) =18816

External references