Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.
A079268
Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =3a(6) =1a(7) =7a(8) =15a(9) =15a(10) =1a(11) =15a(12) =57a(13) =105a(14) =105a(15) =1a(16) =31a(17) =195a(18) =561a(19) =945a(20) =945a(21) =1a(22) =63a(23) =633a(24) =2685a(25) =6555a(26) =10395a(27) =10395a(28) =1a(29) =127
External references
- oeis: A079268