# Program to find the Nth term of series 0, 4, 14, 30, 51, 80, 114, 154, 200, …

Given a number N. The task is to write a program to find the Nth term of the below series:

0, 4, 14, 30, 51, 80, 114, 154, 200, …(N Terms)

Examples:

Input: N = 4
Output: 82
For N = 4
4th Term = ( 4 * 4 - 2 * 4 + 2)
= 10

Input: N = 10
Output: 122

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: The generalized Nth term of this series:

Below is the required implementation:

## C++

 // CPP program to find the N-th term of the series: // 5, 10, 17, 26, 37, 50, 65, 82, ... #include #include using namespace std;    // calculate Nth term of series int nthTerm(int n) {     return pow(n, 2) - 2 * n + 2; }    // Driver Function int main() {     int N = 4;        cout << nthTerm(N);        return 0; }

## Java

 // Java program to find the N-th term of the series:  // 5, 10, 17, 26, 37, 50, 65, 82, ...  import java.util.*;     class solution  {     // calculate Nth term of series  static int nthTerm(int n)  {             //return the total sum      return (int)Math.pow(n, 2) - 2 * n + 2;  }     //Driver function  public static void main(String arr[])  {      int N = 4;         System.out.println(nthTerm(N));     }     }

## Python3

 # Python3 program to find the N-th  # term of the series:  # 0, 4, 14, 30, 51, 80, 114, 154, 200, …    # from math lib. import everything from math import *    # calculate Nth term of series  def nthTerm(n) :            return pow(n, 2) - 2 * n + 2               # Driver code      if __name__ == "__main__" :        N = 4     print(nthTerm(N))    # This code is contributed by  # ANKITRAI1

## C#

 // C# program to find the  // N-th term of the series:  // 5, 10, 17, 26, 37, 50, 65, 82, ...  using System;    class GFG {    // calculate Nth term of series  public static int nthTerm(int n) {        // return the total sum      return (int)Math.Pow(n, 2) -                      2 * n + 2; }    // Driver Code  public static void Main(string[] arr) {     int N = 4;        Console.WriteLine(nthTerm(N)); } }    // This code is contributed // by Shrikant13

## PHP



Output:

10

Time Complexity: O(1)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.