Number T(n,k) of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A288387
Number T(n,k) of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =1a(6) =2a(7) =2a(8) =0a(9) =1a(10) =8a(11) =5a(12) =0a(13) =0a(14) =1a(15) =25a(16) =13a(17) =3a(18) =0a(19) =0a(20) =1a(21) =83a(22) =35a(23) =13a(24) =0a(25) =0a(26) =0a(27) =1a(28) =282a(29) =112
External references
- oeis: A288387