Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and height k (n>=0, k>=0).

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =3a(6) =1a(7) =7a(8) =1a(9) =1a(10) =15a(11) =5a(12) =1a(13) =31a(14) =18a(15) =1a(16) =1a(17) =63a(18) =56a(19) =7a(20) =1a(21) =127a(22) =161a(23) =33a(24) =1a(25) =1a(26) =255a(27) =441a(28) =129a(29) =9