11364568

Appears in sequences

• Number of (n+1) X 3 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=4A206015
• Number of (n+1) X 6 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=1A206018
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=16A206021
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.at n=19A206021