422016
domain: N
Appears in sequences
- Number of one-sided triangular polyominoes (n-iamonds) with n cells; turning over not allowed, holes are allowed.at n=15A006534
- Number of (n+1) X 2 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=6A206678
- Number of (n+1) X 8 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=0A206684
- 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=21A206685
- 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=27A206685