T(n,k)=Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(k+2) board.
A251531
T(n,k)=Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(k+2) board.
Terms
- a(0) =3465a(1) =30377a(2) =30377a(3) =318659a(4) =546525a(5) =318659a(6) =3222565a(7) =11314071a(8) =11314071a(9) =3222565a(10) =31361437a(11) =216137483a(12) =463425639a(13) =216137483a(14) =31361437a(15) =307927905a(16) =4060878845a(17) =17145057973a(18) =17145057973a(19) =4060878845a(20) =307927905a(21) =3055869419a(22) =77906507591
External references
- oeis: A251531