T(n,k) is the total number of levels in all Dyck paths of semilength n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.

A371928

T(n,k) is the total number of levels in all Dyck paths of semilength n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =3a(7) =5a(8) =6a(9) =1a(10) =8a(11) =15a(12) =13a(13) =11a(14) =1a(15) =23a(16) =44a(17) =43a(18) =29a(19) =20a(20) =1a(21) =71a(22) =134a(23) =138a(24) =106a(25) =62a(26) =37a(27) =1a(28) =229a(29) =427

External references