Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).

A114583

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =1a(5) =7a(6) =2a(7) =15a(8) =6a(9) =36a(10) =14a(11) =1a(12) =85a(13) =39a(14) =3a(15) =209a(16) =102a(17) =12a(18) =517a(19) =280a(20) =37a(21) =1a(22) =1303a(23) =758a(24) =123a(25) =4a(26) =3312a(27) =2085a(28) =381a(29) =20

External references