Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes.

A032048

Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =6a(6) =13a(7) =29a(8) =64a(9) =148a(10) =355a(11) =857a(12) =2100a(13) =5198a(14) =12960a(15) =32701a(16) =82826a(17) =211352a(18) =541832a(19) =1397654a(20) =3614607a(21) =9402256a(22) =24500619a(23) =64134061a(24) =168178732a(25) =442710004a(26) =1166705391a(27) =3085691999a(28) =8168951368a(29) =21689446136

External references