242602
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of Dyck n-paths with k large components, 0 <= k <= n/2.at n=51A097877
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,3,4,1,0 for x=0,1,2,3,4.at n=6A196986
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,3,4,1,0 for x=0,1,2,3,4.at n=4A196988
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,3,4,1,0 for x=0,1,2,3,4.at n=59A196989
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,3,4,1,0 for x=0,1,2,3,4.at n=61A196989