44148

Appears in sequences

• Number of ways to place 8 nonattacking queens on an 8 X n board.at n=10A172449
• Number of 6-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=15A187159
• Omit the initial 1 from A000141 and take the Mobius transform.at n=46A190622
• Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=62A269133
• Number of permutations of length n sortable by 4 passes through a pop-stack.at n=9A293775
• Number of n X n 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A301355
• Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A301359
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=60A301361
• The profiles of the backtrack tree for the n queens problem, triangle read by rows.at n=74A319284
• Number of permutations p of [n] such that i + p(i) is composite for all i.at n=10A392408