Triangle read by rows: T(n,k) is the number of labeled rooted trees of height at most 2 that have exactly k nodes at a distance 2 from the root; n>=1, 0<=k<=n-1.

A216255

Triangle read by rows: T(n,k) is the number of labeled rooted trees of height at most 2 that have exactly k nodes at a distance 2 from the root; n>=1, 0<=k<=n-1.

Terms

    a(0) =1a(1) =2a(2) =0a(3) =3a(4) =6a(5) =0a(6) =4a(7) =24a(8) =12a(9) =0a(10) =5a(11) =60a(12) =120a(13) =20a(14) =0a(15) =6a(16) =120a(17) =540a(18) =480a(19) =30a(20) =0a(21) =7a(22) =210a(23) =1680a(24) =3780a(25) =1680a(26) =42a(27) =0a(28) =8a(29) =336

External references