A243716 Irregular triangle read by rows: T(n, k) = number of inequivalent (mod the dihedral group D_8 of order 8) ways to place k nonattacking knights on an n X n board.
1, 1, 2, 1, 1, 3, 7, 9, 6, 2, 3, 18, 40, 66, 49, 30, 8, 3, 6, 43, 195, 609, 1244, 1767, 1710, 1148, 510, 154, 31, 6, 1, 6, 83, 618, 3375, 12329, 32524, 61731, 86748, 90059, 70128, 40770, 18053, 6089, 1643, 344, 61, 7, 1, 10, 156, 1751, 14181, 81900, 348541
Offset: 1
Examples
The triangle begins: 1; 1, 2, 1, 1; 3, 7, 9, 6, 2; 3, 18, 40, 66, 49, 30, 8, 3; 6, 43, 195, 609, 1244, 1767, 1710, 1148, 510, 154, 31, 6, 1; ...
Links
- Heinrich Ludwig, Table of n, a(n) for n = 1..116
Comments