3222565

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=3A251526
• Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(4+2) board.at n=0A251529
• 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=6A251531
• 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=9A251531