317736

Appears in sequences

• Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.at n=4A206679
• Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.at n=1A206682
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.at n=16A206685
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.at n=19A206685
• G.f. satisfies: A(x) = (1+x*A(x))*(1+x*A(x)^2)*(1+x*A(x)^3).at n=6A212070