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

A032066

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =6a(6) =13a(7) =29a(8) =65a(9) =151a(10) =365a(11) =887a(12) =2185a(13) =5426a(14) =13636a(15) =34529a(16) =88017a(17) =225621a(18) =581461a(19) =1505490a(20) =3913987a(21) =10214576a(22) =26748565a(23) =70263410a(24) =185089117a(25) =488842459a(26) =1294194744a(27) =3433966729a(28) =9130325683a(29) =24322504467

External references