Table T(n,k) (listed antidiagonalwise in order T(0,0), T(1,0), T(0,1), T(2,0), T(1,1), ...) giving the number of rooted plane binary trees of size n and "contracted height" k.
A073346
Table T(n,k) (listed antidiagonalwise in order T(0,0), T(1,0), T(0,1), T(2,0), T(1,1), ...) giving the number of rooted plane binary trees of size n and "contracted height" k.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =0a(4) =0a(5) =0a(6) =1a(7) =2a(8) =0a(9) =0a(10) =0a(11) =0a(12) =0a(13) =0a(14) =0a(15) =0a(16) =2a(17) =4a(18) =0a(19) =0a(20) =0a(21) =0a(22) =2a(23) =4a(24) =0a(25) =0a(26) =0a(27) =0a(28) =1a(29) =0
External references
- oeis: A073346