Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k UDH's starting at level 0 (U=(1,1),H=(1,0),D=(1,-1)).

A114581

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k UDH's starting at level 0 (U=(1,1),H=(1,0),D=(1,-1)).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =1a(5) =7a(6) =2a(7) =16a(8) =5a(9) =40a(10) =10a(11) =1a(12) =100a(13) =24a(14) =3a(15) =256a(16) =58a(17) =9a(18) =663a(19) =149a(20) =22a(21) =1a(22) =1741a(23) =386a(24) =57a(25) =4a(26) =4620a(27) =1017a(28) =147a(29) =14

External references