307927905

Appears in sequences

• Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(1+2) board.at n=5A251526
• 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.at n=15A251531
• 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.at n=20A251531