Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.
A097692
Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =2a(4) =10a(5) =8a(6) =2a(7) =26a(8) =30a(9) =12a(10) =2a(11) =70a(12) =104a(13) =60a(14) =16a(15) =2a(16) =192a(17) =350a(18) =260a(19) =100a(20) =20a(21) =2a(22) =534a(23) =1152a(24) =1050a(25) =520a(26) =150a(27) =24a(28) =2a(29) =1500
External references
- oeis: A097692