Triangle read by rows T(n,k) = the number of Dyck paths of semilength n with k UUDDU's, 0<=k<=[(n-1)/2].
A114848
Triangle read by rows T(n,k) = the number of Dyck paths of semilength n with k UUDDU's, 0<=k<=[(n-1)/2].
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =10a(6) =4a(7) =28a(8) =13a(9) =1a(10) =82a(11) =44a(12) =6a(13) =248a(14) =153a(15) =27a(16) =1a(17) =770a(18) =536a(19) =116a(20) =8a(21) =2440a(22) =1889a(23) =486a(24) =46a(25) =1a(26) =7858a(27) =6696a(28) =1992a(29) =240
External references
- oeis: A114848