Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to +-1, with n nodes that have no label greater than k.
A101477
Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to +-1, with n nodes that have no label greater than k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =2a(8) =7a(9) =12a(10) =1a(11) =2a(12) =8a(13) =31a(14) =56a(15) =1a(16) =2a(17) =8a(18) =39a(19) =156a(20) =288a(21) =1a(22) =2a(23) =8a(24) =40a(25) =211a(26) =851a(27) =1584a(28) =1a(29) =2
External references
- oeis: A101477