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

A103331

Number of ways to place n+1 queens and a pawn 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) =2a(6) =3a(7) =16a(8) =52a(9) =286a(10) =1403a(11) =8214a(12) =54756a(13) =389833a(14) =2923757a(15) =22932960a(16) =184339572

External references