Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= floor(n/2), except k = 0 if n = 1 ) nodes of one color and n-k nodes of the other color (the colors are interchangeable).
A122087
Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= floor(n/2), except k = 0 if n = 1 ) nodes of one color and n-k nodes of the other color (the colors are interchangeable).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =2a(7) =1a(8) =2a(9) =3a(10) =1a(11) =3a(12) =7a(13) =1a(14) =3a(15) =10a(16) =9a(17) =1a(18) =4a(19) =14a(20) =28a(21) =1a(22) =4a(23) =19a(24) =45a(25) =37a(26) =1a(27) =5a(28) =24a(29) =73
External references
- oeis: A122087