329216

Appears in sequences

• Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=2A206191
• Number of (n+1)X4 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=1A206192
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=7A206197
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=8A206197
• T(m,n) is the number of suitably connected m X n Legendrian mosaics read by rows, with 1<=n<=m.at n=18A375354