Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.

A244081

Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =6a(6) =4a(7) =1a(8) =1a(9) =9a(10) =28a(11) =36a(12) =18a(13) =2a(14) =1a(15) =16a(16) =96a(17) =276a(18) =412a(19) =340a(20) =170a(21) =48a(22) =6a(23) =1a(24) =25a(25) =252a(26) =1360a(27) =4436a(28) =9386a(29) =13384

External references