A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.)

A071163

A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.)

Terms

    a(0) =0a(1) =1a(2) =2a(3) =3a(4) =4a(5) =5a(6) =7a(7) =8a(8) =9a(9) =10a(10) =12a(11) =13a(12) =17a(13) =18a(14) =21a(15) =22a(16) =23a(17) =24a(18) =26a(19) =27a(20) =31a(21) =32a(22) =35a(23) =36a(24) =45a(25) =46a(26) =49a(27) =50a(28) =58a(29) =59

External references