16032016
domain: N
Appears in sequences
- Number of walks on square lattice. Column y=3 of A052174.at n=12A005561
- (Terms in A014762)/4.at n=25A051514
- Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(6,n).at n=14A132464
- a(n) is the number of walks from (0,0) to (0,3) that remain in the upper half-plane y >= 0 using 2*n +1 unit steps either up (U), down (D), left (L) or right (R).at n=6A145602