Solution Counts

N	k=1	k=2	k=3	k=4	k=5	k=6	k=7	k=8	k=9	k=10
5 or less	0	0	0	0	0	0	0	0	0	0
6	16	0	0	0	0	0	0	0	0	0
7	20	4	0	0	0	0	0	0	0	0
8	128	44	8	0	0	0	0	0	0	0
9	396	280	44	8	0	0	0	0	0	0
10	2,288	1,304	528	88	0	0	0	0	0	0
11	11,152	12,452	5,976	1,688	196	4	0	0	0	0
12	65,712	105,012	77,896	30,936	7,032	888	48	0	0	0
13	437,848	977,664	1,052,884	627,916	225,884	48,384	7,052	544	8	0
14	3,118,664	9,239,816	13,666,360	11,546,884	6,077,320	2,108,304	501,816	87,792	10,728	1,064
15	23,387,448	90,776,620	179,787,988	209,256,136	154,979,740	77,294,692	27,156,516	6,992,960	1,360,474	211,056
16	183,463,680	897,446,092	2,316,725,816	3,595,861,446
17	1,474,699,536
18

Table 1. Number of N+k Queens Problem solutions.
i.e., number of ways to place N+k Queens and k Pawns
on an N x N board so that no Queens attack each other.

N	k=1	k=2	k=3	k=4	k=5	k=6	k=7	k=8	k=9	k=10
5 or less	0	0	0	0	0	0	0	0	0	0
6	2	0	0	0	0	0	0	0	0	0
7	3	1	0	0	0	0	0	0	0	0
8	16	6	1	0	0	0	0	0	0	0
9	52	37	6	1	0	0	0	0	0	0
10	286	164	66	11	0	0	0	0	0	0
11	1,403	1,572	751	215	29	1	0	0	0	0
12	8,214	13,133	9,737	3,871	879	111	6	0	0	0
13	54,756	122,279	131,672	78,560	28,268	6,066	888	69	2	0
14	389,833	1,155,103	1,708,295	1,443,461	759,665	263,561	62,727	10,976	1,341	133
15	2,923,757	11,347,863	22,474,269	26,158,142	19,373,253	9,662,493	3,394,860	874,338	170,117	26,426
16	22,932,960	112,182,378	289,590,727	449,484,829
17	184,339,572
18

Table 2. Number of fundamental solutions to the N+k Queens Problem.

A fundamental solution is an equivalence class of solutions, where rotations and reflections of a solution are considered equivalent. (i.e. Two or more solutions that are rotations and/or reflections of each other count as only one fundamental solution.)