397689
domain: N
Appears in sequences
- Number of n X 3 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=6A183486
- Number of nX7 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=2A183490
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=38A183492
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=42A183492
- Number of inequivalent ways to cut an n X n square into squares with integer sides, such that the dissection has 180-degree rotational symmetry, but no other symmetries.at n=9A240124