7482: [CSES Problem Set] Two Knights
[Creator : ]
Description
Your task is to count for $k=1,2,…,n$ the number of ways two knights can be placed on a $k×k$ chessboard so that they do not attack each other.
Input
The only input line contains an integer $n$.
Output
Print $n$ integers: the results.
Constraints
$1≤n≤10000$
Sample 1 Input
8
Sample 1 Output
0
6
28
96
252
550
1056
1848