Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions.
A002464
Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =0a(4) =2a(5) =14a(6) =90a(7) =646a(8) =5242a(9) =47622a(10) =479306a(11) =5296790a(12) =63779034a(13) =831283558a(14) =11661506218a(15) =175203184374
External references
- oeis: A002464