Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 2.
A101307
Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 2.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =2a(5) =7a(6) =6a(7) =1a(8) =18a(9) =18a(10) =6a(11) =47a(12) =59a(13) =24a(14) =2a(15) =129a(16) =188a(17) =96a(18) =16a(19) =362a(20) =605a(21) =369a(22) =90a(23) =4a(24) =1038a(25) =1948a(26) =1395a(27) =436a(28) =45a(29) =3022
External references
- oeis: A101307