What are the number of ways two knights can be placed on a k×k chessboard so that they do not attack each other?

```
For k from 1 to 8, the answer is given below. How do I find a general formula?
0
6
28
96
252
550
1056
1848
```

What are the number of ways two knights can be placed on a k×k chessboard so that they do not attack each other?

```
For k from 1 to 8, the answer is given below. How do I find a general formula?
0
6
28
96
252
550
1056
1848
```

Can you please provide the explanation for that formula? (nvm Found it)

where did you find the explanation?

Do share the link of explanation