Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.
A101486
Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =9a(6) =1a(7) =3a(8) =17a(9) =54a(10) =1a(11) =3a(12) =18a(13) =119a(14) =378a(15) =1a(16) =3a(17) =18a(18) =134a(19) =932a(20) =2916a(21) =1a(22) =3a(23) =18a(24) =135a(25) =1111a(26) =7838a(27) =24057a(28) =1a(29) =3
External references
- oeis: A101486