A Motzkin triangle: a(n,k), n >= 2, 2 <= k <= n, = number of complete, strictly subdiagonal staircase functions.

A020474

A Motzkin triangle: a(n,k), n >= 2, 2 <= k <= n, = number of complete, strictly subdiagonal staircase functions.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =0a(8) =2a(9) =4a(10) =0a(11) =0a(12) =1a(13) =5a(14) =9a(15) =0a(16) =0a(17) =0a(18) =3a(19) =12a(20) =21a(21) =0a(22) =0a(23) =0a(24) =1a(25) =9a(26) =30a(27) =51a(28) =0a(29) =0

External references