123893883

Appears in sequences

• Number of (n+1) X 3 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one.at n=6A206048
• Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=1A206053
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=29A206054