Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUDU's starting at level 1.
A135333
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUDU's starting at level 1.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =11a(6) =2a(7) =1a(8) =32a(9) =7a(10) =2a(11) =1a(12) =99a(13) =22a(14) =8a(15) =2a(16) =1a(17) =318a(18) =73a(19) =26a(20) =9a(21) =2a(22) =1a(23) =1051a(24) =246a(25) =90a(26) =30a(27) =10a(28) =2a(29) =1
External references
- oeis: A135333