Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k occurrences of the string ududu, where u=(1,1), d=(1,-1).
A246188
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k occurrences of the string ududu, where u=(1,1), d=(1,-1).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =11a(6) =2a(7) =1a(8) =31a(9) =8a(10) =2a(11) =1a(12) =92a(13) =28a(14) =9a(15) =2a(16) =1a(17) =283a(18) =99a(19) =34a(20) =10a(21) =2a(22) =1a(23) =893a(24) =354a(25) =129a(26) =40a(27) =11a(28) =2a(29) =1
External references
- oeis: A246188