86226

Appears in sequences

• Number of length n+6 0..1 arrays with at most two downsteps in every 6 consecutive neighbor pairs.at n=10A256814
• Number of n X 3 arrays containing 3 copies of 0..n-1 with no equal horizontal, vertical, diagonal or antidiagonal neighbors and new values introduced sequentially from 0.at n=5A265420
• T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no equal horizontal, vertical, diagonal or antidiagonal neighbors and new values introduced sequentially from 0.at n=33A265421