Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 3 (n >= 0, k >= 0).
A120983
Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 3 (n >= 0, k >= 0).
Terms
- a(0) =1a(1) =3a(2) =12a(3) =54a(4) =1a(5) =261a(6) =12a(7) =1323a(8) =105a(9) =6939a(10) =810a(11) =3a(12) =37341a(13) =5859a(14) =63a(15) =205011a(16) =40824a(17) =840a(18) =1143801a(19) =277830a(20) =9072a(21) =12a(22) =6466230a(23) =1861380a(24) =86670a(25) =360a(26) =36960300a(27) =12335895a(28) =764478a(29) =6435
External references
- oeis: A120983