Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.
A051570
Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.
Terms
- a(0) =2a(1) =4a(2) =31a(3) =307a(4) =2a(5) =9a(6) =755a(7) =39302
External references
- oeis: A051570