Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k peaks at height 1.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =2a(6) =5a(7) =3a(8) =1a(9) =12a(10) =6a(11) =3a(12) =29a(13) =15a(14) =6a(15) =1a(16) =72a(17) =38a(18) =13a(19) =4a(20) =183a(21) =96a(22) =33a(23) =10a(24) =1a(25) =473a(26) =246a(27) =87a(28) =24a(29) =5