205452

Appears in sequences

• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, southwest or northwest neighbor modulo n and the upper left element equal to 0.at n=39A266878
• Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its north, southwest or northwest neighbor modulo 4 and the upper left element equal to 0.at n=5A266880
• a(n) is the total number of down steps between the (n-1)-th and n-th up steps in all 3-Dyck paths of length 4*n. A 3-Dyck path is a nonnegative lattice path with steps (1, 3), (1, -1) that starts and ends at y = 0.at n=7A334978