#include <bits/stdc++.h>
using namespace std;
const int mod = 1;
int main() {
  int n;
  scanf("%d", &n);
  long long t = 2;
  int cnt = 0;
  for (int i = 2; i <= n + 1; i++) {
    if (i == 2) {
      cout << ((long long)i * i * (i - 1) * (i - 1) - 2) / (i - 1) << endl;
    } else
      cout << ((long long)i * i * (i - 1) - (i - 2)) << endl;
  }
  return 0;
}
