TwoKnights.cpp

#include <bits/stdc++.h>
using namespace std;

void swap(int*a,int*b){
    int temp = *a;
    *a = *b;
    *b = temp;
}

// array[n-1] += 12*((n-1)*(n-1) - 2);
// array[n-1] += 8*((n-1)*(n-1) - 3);
// array[n-1] += (n-6)*((n-1)*(n-1) - 4);

void solve(long long*array,int n){
    if(n <= 8){return;}
    else{
        solve(array,n-1);
        array[n] = array[n-1];
        array[n] += 12*((n-1)*(n-1) - 2);
        array[n] += 8*((n-1)*(n-1) - 3);
        array[n] += 4*(n-6)*((n-1)*(n-1) - 4);
    }
}



int main(){
    int n;
    cin >> n;
    long long array[100000];

    array[1] = 0;
    array[2] = 6;
    array[3] = 28;
    array[4] = 96;
    array[5] = 252;
    array[6] = 550;
    array[7] = 1056;
    array[8] = 1848;

    solve(array,n);

    for(int i = 1 ; i <= n ; i ++){
        cout << array[i] << endl;
    }

    return 0;
}