166702

Appears in sequences

• Triangle T(n, k) = Number of ways to arrange k indistinguishable points on an n X n square grid so that no four of them are vertices of a square of any orientation.at n=30A240444
• Numbers of ways to place six indistinguishable points on an n X n square grid so that no four of them are vertices of a square of any orientation.at n=2A240446
• Number of nX3 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=9A281395