object C extends App {

  @inline def tokenizeLine = new java.util.StringTokenizer(readLine)
  def readInts(n: Int) = { val tl = tokenizeLine; Array.fill(n)(tl.nextToken.toInt) }

  val Array(n) = readInts(1)
  var x = BigInt(2)

  val res = Array.ofDim[BigInt](n + 1)

  for (k <- 1L to n) {
    val k1 = k + 1
    val k1k1 = k1 * k1

    val y = k * k1k1 - x / k
    //val y = z / k
    res(k.toInt) = y
    x = k * k1
  }

  Console.setOut(new java.io.BufferedOutputStream(Console.out))

  println(res.drop(1).mkString("\n"))

  Console.flush
}

import Utils._, annotation.tailrec, collection.mutable, util._, control._, math.Ordering.Implicits._, collection.Searching._

object _716C extends CodeForcesApp {
  override def apply(io: IO) = {import io.{read, write, writeAll, writeLine}
    val n = read[Int]
    val ans = solve3(n+1)
    writeAll(ans)
  }

  def solve2(goal: Int): Seq[BigInt] = {
    var ans = mutable.ArrayBuffer.empty[BigInt]
    var display = 2L

    var n = 2
    while(n <= goal) {
      val ns = BigInt(n) * n

      val f = (Iterator.from(1) find {i =>
        val target = ns * i * i
        val pushes = target - display
        pushes >= 0 && pushes%(n-1) == 0
      }).get

      debug(n, f, display)

      ans += ((BigInt(f) * f * n * n) - display)/(n-1)
      //debug(n, f, ans.last, display, f.toLong * n)
      display = f.toLong * n
      n += 1
    }
    ans
  }

  def solve3(goal: Int): Seq[BigInt] = {
    var ans = mutable.ArrayBuffer.empty[BigInt]
    var display = 2L

    var n = 2L
    while(n <= goal) {
      val f = n*(n - 1)
      ans += (f*n - display/(n-1))
      display = f
      n += 1
    }
    ans
  }
}
/****************************[Ignore Template Below]****************************************/
trait CodeForcesApp {
  lazy val isOnlineJudge: Boolean = sys.props.get("ONLINE_JUDGE").exists(_.toBoolean)
  def debug(x: => Any): Unit = if (!isOnlineJudge) println(x)
  def apply(io: IO): io.type
  def main(args: Array[String]): Unit = this(new IO(System.in, System.out)).close()
}
object Utils {
  import scala.collection.mutable, mutable.{Map => Dict}
  implicit class GenericExtensions[A](val a: A) extends AnyVal {
    def in(set: collection.Set[A]): Boolean = set(a)
    def some: Option[A] = Some(a)
    def partialMatch[B](f: PartialFunction[A, B]): Option[B] = f lift a
  }
  implicit class TraversableExtensions[A, C[X] <: Traversable[X]](val t: C[A]) extends AnyVal {
    def onlyElement: A = assuming(t.size == 1)(t.head)
    def groupByIdentifier[K](f: A => K): Map[K, A] = t.groupBy(f).mapValues(_.onlyElement)
    def duplicates(implicit b: C of A): C[A] = {
      val elems = mutable.Set.empty[A]
      (t collect {case i if !elems.add(i) => i}).to[C]
    }
    def sumWith[B](f: A => B)(implicit n: Numeric[B]): B = t.foldLeft(n.zero) {case (p, i) => n.plus(p, f(i))}
    def maxWith[B](f: A => B)(implicit ord: Ordering[B]): Option[B] = t.view.map(f).reduceOption(ord.max)
    def minWith[B](f: A => B)(implicit ord: Ordering[B]): Option[B] = t.view.map(f).reduceOption(ord.min)
    def zipWith[B](f: A => B)(implicit b: C of (A, B)): C[(A, B)] = (t map {i => i -> f(i)}).to[C]
    def mapTo[B](f: A => B)(implicit b: C of (A, B)): Map[A, B] = zipWith(f).toUniqueMap
    def whenNonEmpty[B](f: t.type => B): Option[B] = when(t.nonEmpty)(f(t))  // e.g. grades.whenNonEmpty(_.max)
    def collectFirst[B](f: PartialFunction[A, Option[B]]): Option[B] = t.view collect f collectFirst {case Some(x) => x}
    def toMutableMultiSet: Dict[A, Int] = {
      val c = map[A] to 0
      t.foreach(i => c(i) += 1)
      c
    }
    def toMultiSet: Map[A, Int] = toMutableMultiSet.toMap withDefaultValue 0
    def X[B](s: Traversable[B]): Iterator[(A, B)] = for {a <- t.toIterator; b <- s} yield (a, b)
  }
  implicit class ArrayExtensions[A <: AnyRef](val a: Array[A]) extends AnyVal {
    def sort(from: Int, until: Int)(implicit cmp: Ordering[A]): Unit = java.util.Arrays.sort(a, from, until, cmp) //sort [from, until)
  }
  implicit class ArrayExtensions2[A](val a: Array[A]) extends AnyVal {
    def sort(from: Int, until: Int)(implicit cmp: Ordering[A]): Unit = a.view(from, until).sorted.copyToArray(a, from)
  }
  implicit class SeqExtensions[A, C[X] <: Seq[X]](val s: C[A]) extends AnyVal {
    def isRotationOf(t: Seq[A]): Boolean = s ++ s containsSlice t
  }
  implicit class PairExtensions[A, B](val p: (A, B)) extends AnyVal {
    def key = p._1
    def value = p._2
  }
  implicit class PairsExtensions[A, B, C[X] <: Traversable[X]](t: C[(A, B)]) {
    def toUniqueMap: Map[A, B] = t.groupByIdentifier(_.key).mapValues(_.value)
    def toMultiMap(implicit b: C of B): Map[A, C[B]] = t.groupBy(_.key).mapValues(_.map(_.value).to[C])
    def swap(implicit b: C of (B, A)): C[(B, A)] = t.map(_.swap).to[C]
  }
  implicit class MapExtensions[K, V, C[X, Y] <: Map[X, Y]](val m: C[K, V]) extends AnyVal {
    def lastKeyOption: Option[K] = m.lastOption.map(_.key)
    def firstKeyOption: Option[K] = m.headOption.map(_.key)
    def invert: Map[V, Set[K]] = m.toSet[(K, V)].swap.toMultiMap
    def mapKeys[K2](f: K => K2): Map[K2, V] = m map {case (k, v) => f(k) -> v}
    def toMutable: Dict[K, V] = Dict.empty[K, V] ++ m
  }
  implicit class MutableMapExtensions[K, V](val m: mutable.Map[K, V]) extends AnyVal {
    def removeLast(): Option[(K, V)] = m.lastOption.map(removeNode)
    def removeFirst(): Option[(K, V)] = m.headOption.map(removeNode)
    private def removeNode(kv: (K, V)): (K, V) = {
      m -= kv.key
      kv
    }
  }
  implicit class SetExtensions[A, C[A] <: Set[A]](val s: C[A]) extends AnyVal {
    def notContains(x: A): Boolean = !(s contains x)
    def toMutable = mutable.Set.empty[A] ++ s
  }
  implicit class IterableExtensions[A, C[A] <: Seq[A]](val s: C[A]) extends AnyVal {
    def deleteAtIndex(i: Int, howMany: Int = 1) = s.patch(i, Nil, howMany)
    def insertAtIndex(i: Int, items: Seq[A]) = s.patch(i, items, 0)
    def findWithIndex(f: A => Boolean): Option[(A, Int)] = s.zipWithIndex find {case (a, _) => f(a)}
    def foldUntil[B](z: B)(f: (B, A) => B)(c: B => Boolean): Option[(B, Int)] = s.view.scanLeft(z)(f).findWithIndex(c)
  }
  implicit class BooleanExtensions(val x: Boolean) extends AnyVal {
    def to[A](implicit n: Numeric[A]) = if(x) n.one else n.zero
    def toEnglish = if(x) "YES" else "NO"
  }
  implicit class IntExtensions(val x: Int) extends AnyVal {
    import java.lang.{Integer => JInt}
    def withHighestOneBit: Int = JInt.highestOneBit(x)
    def withLowestOneBit: Int = JInt.lowestOneBit(x)
    def numberOfLeadingZeroes: Int = JInt.numberOfLeadingZeros(x)
    def numberOfTrailingZeroes: Int = JInt.numberOfTrailingZeros(x)
    def bitCount: Int = JInt.bitCount(x)
    def setLowestBits(n: Int): Int = x | (left(n) - 1)
    def clearLowestBits(n: Int): Int = x & left(n, ~0)
    def setBit(i: Int, set: Boolean): Int = if (set) setBit(i) else clearBit(i)
    def setBit(i: Int): Int = x | left(i)
    def clearBit(i: Int): Int = x & ~left(i)
    def toggleBit(i: Int): Int = x ^ left(i)
    def testBit(i: Int): Boolean = ((x >> i) & 1) == 1
    private def left(bits: Int, num: Int = 1) = assuming(bits >= 0 && bits < JInt.SIZE)(num << bits)
    def X(y: Int): Iterator[(Int, Int)] = until(x) X until(y)
  }
  implicit class LongExtensions(val x: Long) extends AnyVal {
    import java.lang.{Long => JLong}
    def withHighestOneBitSet: Long = JLong.highestOneBit(x)
    def withLowestOneBitSet: Long = JLong.lowestOneBit(x)
    def numberOfLeadingZeroes: Int = JLong.numberOfLeadingZeros(x)
    def numberOfTrailingZeroes: Int = JLong.numberOfTrailingZeros(x)
    def bitCount: Int = JLong.bitCount(x)
    def setLowestBits(n: Int): Long = x | (left(n) - 1)
    def clearLowestBits(n: Int): Long = x & left(n, ~0L)
    def setBit(i: Int, set: Boolean): Long = if (set) setBit(i) else clearBit(i)
    def setBit(i: Int): Long = x | left(i)
    def clearBit(i: Int): Long = x & ~left(i)
    def toggleBit(i: Int): Long = x ^ left(i)
    def testBit(i: Int): Boolean = ((x >> i) & 1) == 1
    private def left(bits: Int, num: Long = 1L) = assuming(bits >= 0 && bits < JLong.SIZE)(num << bits)
  }
  implicit class NumericExtensions[A](val x: A)(implicit n: Numeric[A]) {
    import Numeric.Implicits._
    def **(i: Int): A = if (i == 0) n.one else {
      val h = x ** (i/2)
      if (i%2 == 0) h * h else h * h * x
    }
    def distance(y: A) = (x - y).abs()
    def nonNegative: Option[A] = when(n.gteq(x, n.zero))(x)
    def whenNegative(f: => A): A = nonNegative getOrElse f   //e.g. students indexOf "Greg" whenNegative Int.MaxValue
  }
  implicit class IntegralExtensions[A](val x: A)(implicit n: Integral[A]) {
    import scala.collection.immutable.NumericRange, Integral.Implicits._
    def mod(y: A): A = x - ((x / y) * y) //(x/y)*y + (x mod y) == x
    def -->(y: A): NumericRange.Inclusive[A] = NumericRange.inclusive(x, y, if (n.lteq(x, y)) n.one else -n.one)
    def ceilDiv(y: A): A = if (mod(y) == n.zero) x/y else n.one + (x/y)
  }
  implicit def toPoint[A](p: (A, A))(implicit n: Numeric[A]) = new java.awt.geom.Point2D.Double(n.toDouble(p._1), n.toDouble(p._2))
  def desc[A: Ordering]: Ordering[A] = asc[A].reverse  //e.g. students.sortBy(_.height)(desc)
  def asc[A](implicit order: Ordering[A]): Ordering[A] = order
  def map[K] = new {
    def to[V](default: => V): Dict[K, V] = using(_ => default)
    def using[V](f: K => V): Dict[K, V] = new mutable.HashMap[K, V]() {
      override def apply(key: K) = getOrElseUpdate(key, f(key))
    }
  }
  def newMultiMap[K, V] = map[K] to mutable.Set.empty[V]
  def memoize[A, B](f: A => B): A ==> B = map[A] using f
  implicit class FuzzyDouble(val x: Double) extends AnyVal {
    def  >~(y: Double) = x > y + eps
    def >=~(y: Double) = x >= y + eps
    def  ~<(y: Double) = y >=~ x
    def ~=<(y: Double) = y >~ x
    def  ~=(y: Double) = (x distance y) <= eps
  }
  def toPolygon(points: Traversable[(Int, Int)]): java.awt.Polygon = {
    val (xs, ys) = points.unzip
    new java.awt.Polygon(xs.toArray, ys.toArray, points.size)
  }
  def toShape(points: Traversable[(Double, Double)]): java.awt.geom.GeneralPath = {
    val shape = new java.awt.geom.GeneralPath()
    points.headOption foreach {case (x, y) => shape.moveTo(x, y)}
    points.tail foreach {case (x, y) => shape.lineTo(x, y)}
    shape.closePath()
    shape
  }
  def until(until: Int): Range = 0 until until
  def not[A](f: A => Boolean): A => Boolean = {x: A => !f(x)}
  def assuming[A](cond: => Boolean)(f: => A): A = {require(cond); f}
  @inline def when[A](check: Boolean)(f: => A): Option[A] = if (check) f.some else None
  def repeat[U](n: Int)(f: => U): Unit = (1 to n).foreach(_ => f)
  type of[C[_], A] = scala.collection.generic.CanBuild[A, C[A]]
  type ==>[A, B] = collection.Map[A, B]
  val mod: Int = (1e9 + 7).toInt
  val eps: Double = 1e-9
}
/***********************************[Scala I/O]*********************************************/
import Utils._, java.io._, java.util.StringTokenizer

class IO(in: BufferedReader, out: BufferedWriter) extends Iterator[String] with AutoCloseable with Flushable {
  def this(reader: Reader, writer: Writer) = this(new BufferedReader(reader), new BufferedWriter(writer))
  def this(in: InputStream, out: OutputStream) = this(new InputStreamReader(in), new OutputStreamWriter(out))

  private[this] val tokenizers = Iterator.continually(in.readLine()).takeWhile(_ != null).map(new StringTokenizer(_)).buffered
  val printer = new PrintWriter(out, true)

  @inline private[this] def tokenizer() = {
    while(tokenizers.nonEmpty && !tokenizers.head.hasMoreTokens) tokenizers.next()
    when(tokenizers.nonEmpty)(tokenizers.head)
  }

  def read[A](implicit read: IO.Read[A]): A = read.apply(this)
  def read[C[_], A: IO.Read](n: Int)(implicit b: C of A): C[A] = Iterator.fill(n)(read).to[C]

  def readTill(delim: String): String = tokenizer().get.nextToken(delim)
  def readTillEndOfLine(): String = readTill("\n\r")

  override def next() = tokenizer().get.nextToken()
  override def hasNext = tokenizer().nonEmpty

  def write(obj: Any): this.type = {
    printer.print(obj)
    this
  }
  def writeLine(): this.type = {
    printer.println()
    this
  }
  def writeLine(obj: Any): this.type = {
    printer.println(obj)
    this
  }
  def writeAll(obj: Traversable[Any], separator: String = "\n"): this.type = write(obj mkString separator)
  def query[A: IO.Read](question: Any): A = writeLine(question).read

  override def flush() = printer.flush()
  def close() = {
    flush()
    in.close()
    printer.close()
  }
}
object IO {
  class Read[A](val apply: IO => A) {
    def map[B](f: A => B): Read[B] = new Read(apply andThen f)
  }
  object Read {
    implicit def collection[C[_], A: Read](implicit b: C of A): Read[C[A]]         = new Read(r => r.read[C, A](r.read[Int]))
    implicit val string                                       : Read[String]       = new Read(_.next())
    implicit val char                                         : Read[Char]         = string.map(_.toTraversable.onlyElement)
    implicit val int                                          : Read[Int]          = string.map(_.toInt)
    implicit val long                                         : Read[Long]         = string.map(_.toLong)
    implicit val bigInt                                       : Read[BigInt]       = string.map(BigInt(_))
    implicit val double                                       : Read[Double]       = string.map(_.toDouble)
    implicit val bigDecimal                                   : Read[BigDecimal]   = string.map(BigDecimal(_))
    implicit def tuple2[A: Read, B: Read]                     : Read[(A, B)]       = new Read(r => (r.read[A], r.read[B]))
    implicit def tuple3[A: Read, B: Read, C: Read]            : Read[(A, B, C)]    = new Read(r => (r.read[A], r.read[B], r.read[C]))
    implicit def tuple4[A: Read, B: Read, C: Read, D: Read]   : Read[(A, B, C, D)] = new Read(r => (r.read[A], r.read[B], r.read[C], r.read[D]))
    implicit val boolean                                      : Read[Boolean]      = string map {s =>
      s.toLowerCase match {
        case "yes" | "true" | "1" => true
        case "no" | "false" | "0" => false
        case _ => s.toBoolean
      }
    }
  }
}

//package merofeev.contests.codeforces.rnd372

import java.util.Scanner

/**
  * @author erofeev
  * @since 17.09.16
  */
object CSqrt {

  def nextNum(x: Long, k: Int): BigInt = {
    var nextNum = 1L
    var i = k.toLong
    val kksqr: Long = k * (k + 1).toLong
//    val pos1: BigInt = k * BigInt(k + 1).pow(2)
    val pos: BigInt = BigInt(kksqr).pow(2) //8100 = (k^2 * (k + 1)^2). we want 900 = k * (k+1)^2
    return pos
//    val posSquare: BigInt = pos / k //900
//    if ((pos1 % (k * k))  != 0 ) {
//      return pos
//    }
//    return pos1
    val nextKPow: Long = (k + 1) * (k + 1)
    while (true) {
      nextNum = i * i
      if (
      //        nextNum % k == 0 &&
        nextNum % nextKPow == 0
          && (nextNum - x) % k == 0) {
        return nextNum
      }
      i += 1
    }
    throw new IllegalStateException(k + "")
  }

  def main(args: Array[String]): Unit = {
                val need = new Scanner(System.in).nextInt()
//    val need = 1000
    var k = 1L
    while (k <= need) {
//      val nextX: BigInt = nextNum(x, k)
//      val steps: BigInt = (nextX - x) / k
//      println(k + " " + nextX + "=> " + steps + " steps " + (k + 1) + " lvl")
      if (k == 1) {
        println(2)
      } else {
        println(k * (k + 1) * (k + 1) - (k - 1))
      }
      k += 1
    }
  }
}

//package merofeev.contests.codeforces.rnd372

/**
  * @author erofeev
  * @since 17.09.16
  */
object CSqrt {

  def nextNum(x: Long, k: Int): Long = {
    var nextNum = 1L
    var i = k.toLong
    val kksqr: Long = k * (k + 1).toLong
    return kksqr * kksqr
    val nextKPow: Long = (k + 1) * (k + 1)
    while (true) {
      nextNum = i * i
      if (
      //        nextNum % k == 0 &&
        nextNum % nextKPow == 0
          && (nextNum - x) % k == 0) {
        return nextNum
      }
      i += 1
    }
    throw new IllegalStateException(k + "")
  }

  def main(args: Array[String]): Unit = {
    //        val need = new Scanner(System.in).nextInt()
    val need = 100
    var k = 1
    var x = 2L
    while (k <= need) {
      val nextX: Long = nextNum(x, k)
      val steps: Long = (nextX - x) / k
      //      println(k + " " + nextX + "=> " + steps + " steps " + (k + 1) + " lvl")
      println(steps)
      x = Math.sqrt(nextX).toLong
      k += 1
    }
  }
}

//package merofeev.contests.codeforces.rnd372

import java.util.Scanner

/**
  * @author erofeev
  * @since 17.09.16
  */
object CSqrt {

  def nextNum(x: Long, k: Int): BigInt = {
    var nextNum = 1L
    var i = k.toLong
    val kksqr: Long = k * (k + 1).toLong
    return BigInt(kksqr).pow(2)
    val nextKPow: Long = (k + 1) * (k + 1)
    while (true) {
      nextNum = i * i
      if (
      //        nextNum % k == 0 &&
        nextNum % nextKPow == 0
          && (nextNum - x) % k == 0) {
        return nextNum
      }
      i += 1
    }
    throw new IllegalStateException(k + "")
  }

  def main(args: Array[String]): Unit = {
            val need = new Scanner(System.in).nextInt()
//    val need = 1000000
    var k = 1
    var x = 2L
    while (k <= need) {
      val nextX: BigInt = nextNum(x, k)
      val steps: BigInt = (nextX - x) / k
//      val steps: Long = (nextX - x) / k
//      println(k + " " + nextX + "=> " + steps + " steps " + (k + 1) + " lvl")
            println(steps)
      x = k * (k + 1)
      k += 1
    }
  }
}

//package merofeev.contests.codeforces.rnd372

import java.util.Scanner

/**
  * @author erofeev
  * @since 17.09.16
  */
object CSqrt {

  def nextNum(x: Long, k: Int): BigInt = {
    var nextNum = 1L
    var i = k.toLong
    val kksqr: Long = k * (k + 1).toLong
//    val pos1: BigInt = k * BigInt(k + 1).pow(2)
    val pos: BigInt = BigInt(kksqr).pow(2) //8100 = (k^2 * (k + 1)^2). we want 900 = k * (k+1)^2
    return pos
//    val posSquare: BigInt = pos / k //900
//    if ((pos1 % (k * k))  != 0 ) {
//      return pos
//    }
//    return pos1
    val nextKPow: Long = (k + 1) * (k + 1)
    while (true) {
      nextNum = i * i
      if (
      //        nextNum % k == 0 &&
        nextNum % nextKPow == 0
          && (nextNum - x) % k == 0) {
        return nextNum
      }
      i += 1
    }
    throw new IllegalStateException(k + "")
  }

  def main(args: Array[String]): Unit = {
                val need = new Scanner(System.in).nextInt()
//    val need = 1000
    var k = 1
    var x = 2L
    while (k <= need) {
      val nextX: BigInt = nextNum(x, k)
      val steps: BigInt = (nextX - x) / k
//      println(k + " " + nextX + "=> " + steps + " steps " + (k + 1) + " lvl")
                  println(steps)
      x = k * (k + 1)
      k += 1
    }
  }
}