Triangle read by rows: T(n,k) = number of paths of n upsteps U and n downsteps D that contain k UUDs.

A051288

Triangle read by rows: T(n,k) = number of paths of n upsteps U and n downsteps D that contain k UUDs.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =2a(4) =8a(5) =12a(6) =16a(7) =48a(8) =6a(9) =32a(10) =160a(11) =60a(12) =64a(13) =480a(14) =360a(15) =20a(16) =128a(17) =1344a(18) =1680a(19) =280a(20) =256a(21) =3584a(22) =6720a(23) =2240a(24) =70a(25) =512a(26) =9216a(27) =24192a(28) =13440a(29) =1260

External references