Number of ordered rooted trees with n edges such that the rightmost leaf of each subtree is at even level. Equivalently, number of Dyck paths of semilength n with no return descents of odd length.
A033297
Number of ordered rooted trees with n edges such that the rightmost leaf of each subtree is at even level. Equivalently, number of Dyck paths of semilength n with no return descents of odd length.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =10a(4) =32a(5) =100a(6) =329a(7) =1101a(8) =3761a(9) =13035a(10) =45751a(11) =162261a(12) =580639a(13) =2093801a(14) =7601044a(15) =27756626a(16) =101888164a(17) =375750536a(18) =1391512654a(19) =5172607766a(20) =19293659254a(21) =72188904386a(22) =270870709264
External references
- oeis: A033297