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

A032065

Number of dyslexic planted planar trees with n+1 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) =14a(7) =31a(8) =70a(9) =163a(10) =407a(11) =984a(12) =2445a(13) =6089a(14) =15412a(15) =39189a(16) =100217a(17) =257720a(18) =666068a(19) =1729169a(20) =4505362a(21) =11784473a(22) =30917383a(23) =81358804a(24) =214658044a(25) =567792612a(26) =1505281859a(27) =3999183421a(28) =10645793860

External references