249664

Appears in sequences

• Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=11A234259
• Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A238050
• Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A238051
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A238054
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A238054