62266

Appears in sequences

• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1.at n=20A098487
• Number of degree n polynomials over GF(2) (with nonzero constant term) at Hamming distance 3 from some irreducible polynomial.at n=23A128903
• Number of ways to place 6 nonattacking kings on an n X n board.at n=5A172158
• Number of ways to place 6 nonattacking kings on a 6 X n board.at n=5A172205
• Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.at n=31A193580
• Number of ways to place n nonattacking kings on an n X n board.at n=6A201513
• Number of n X 2 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal.at n=7A232370
• T(n,k)=Number of nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal.at n=43A232376
• Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two sums of the central column and central row nondecreasing horizontally and vertically.at n=16A258521
• Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.at n=35A362142
• Maximum number of ways in which a set of integer-sided squares can tile an n X n square.at n=7A362143
• Array read by antidiagonals: T(n,k) is the number of ways to place k nonattacking kings on a n X k board.at n=60A390158