Skip to content

A051756

OEIS Lean4

Consider the problem of placing N queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives maximal number of queens.

offset: 2
codomain: ℕ
n2345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
A05175646810121618202224283032343640424446485254565860646668707276788082848890929496100102104106108112114116118120124126128130132136138140142144