Table T(n,k), read by ascending antidiagonals, giving the number of rooted plane binary trees of size n and height k.

A073345

Table T(n,k), read by ascending antidiagonals, giving the number of rooted plane binary trees of size n and height k.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =0a(11) =0a(12) =2a(13) =0a(14) =0a(15) =0a(16) =0a(17) =1a(18) =0a(19) =0a(20) =0a(21) =0a(22) =0a(23) =0a(24) =4a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0

External references