Square array T(n,k), read by antidiagonals: number of binary trees, with n nodes that have no label greater than k.

A101489

Square array T(n,k), read by antidiagonals: number of binary trees, with n nodes that have no label greater than k.

Terms

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

External references