Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=1 and sequence gives number of inequivalent solutions when N is equal to the upper bound 2*floor(2n/3).
A051567
Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=1 and sequence gives number of inequivalent solutions when N is equal to the upper bound 2*floor(2n/3).
Terms
- a(0) =0a(1) =5a(2) =0a(3) =2a(4) =149a(5) =49a(6) =1a(7) =12897a(8) =2238a(9) =109a(10) =2606412a(11) =450118a(12) =17579
External references
- oeis: A051567