#include <bits/stdc++.h>
using namespace std;
vector<bool> isPrime(10000010, true);
inline void seivePrime(long long L, long long R) {
  long long lim = sqrt(R);
  for (long long i = 2; i <= lim; ++i) {
    for (long long j = max(i * i, (L + i - 1) / i * i); j <= R; j += i)
      isPrime[j - L] = false;
  }
  if (L == 1) isPrime[0] = false;
}
inline long long chckPrime(long long L, long long prme) {
  return isPrime[prme - L];
}
inline long long cntPrime(long long L, long long R) {
  return count(isPrime.begin(), isPrime.begin() + R - L + 1, true);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  n++;
  int x = 2;
  for (int i = 1; i < n; i++) {
    if (i == 1)
      cout << 2 << "\n";
    else {
      long long a = i * 1LL * (i + 1) * (i + 1) - (i - 1);
      cout << a << "\n";
    }
  }
  return 0;
}
