login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of inequivalent (mod D_8) ways to place 5 nonattacking knights on an n X n board.
4

%I #8 Jun 19 2014 11:50:40

%S 2,49,1244,12329,81900,398907,1562362,5153001,14907120,38753358,

%T 92417760,204977323,427812496,847346181,1604300270

%N Number of inequivalent (mod D_8) ways to place 5 nonattacking knights on an n X n board.

%F a(n) = (n^10 - 90*n^8 + 240*n^7 + 3235*n^6)/960 + O(n^5) for n >= 8.

%Y Cf. A243716, A172136, A243717, A243718, A243719.

%K nonn,more

%O 3,1

%A _Heinrich Ludwig_, Jun 19 2014