Number of ways to place n+2 queens and 2 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).

A129552

Number of ways to place n+2 queens and 2 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =1a(7) =6a(8) =37a(9) =164a(10) =1572a(11) =13133a(12) =122279a(13) =1155103a(14) =11347863a(15) =112182378

External references