Triangle read by rows: a(n,k) = number of Dyck n-paths such that number of DUs at level 1 plus number of UDs at level 2 is k, 0<=k<=n-1.
A096794
Triangle read by rows: a(n,k) = number of Dyck n-paths such that number of DUs at level 1 plus number of UDs at level 2 is k, 0<=k<=n-1.
Terms
- a(0) =1a(1) =0a(2) =2a(3) =1a(4) =0a(5) =4a(6) =2a(7) =4a(8) =0a(9) =8a(10) =6a(11) =8a(12) =12a(13) =0a(14) =16a(15) =18a(16) =26a(17) =24a(18) =32a(19) =0a(20) =32a(21) =57a(22) =80a(23) =84a(24) =64a(25) =80a(26) =0a(27) =64a(28) =186a(29) =260
External references
- oeis: A096794