Number of ways of placing n non-attacking bishops on an n X n board so that every square is attacked (or occupied).
A005635
Number of ways of placing n non-attacking bishops on an n X n board so that every square is attacked (or occupied).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =8a(6) =36a(7) =110a(8) =666a(9) =3250a(10) =23436a(11) =125198a(12) =1037520a(13) =7241272a(14) =66360960a(15) =500827928a(16) =5080370400a(17) =45926666984a(18) =508032504000
External references
- oeis: A005635