129573608

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=5A206015
• Number of (n+1) X 7 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=1A206019
• 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=22A206021
• 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=26A206021