# Program to find the Nth term of the series 0, 14, 40, 78, 124, …

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

0, 14, 40, 78, 124 …(N Terms)

Examples:

Input: N = 4
Output: 78
For N = 4
Sum(upto 4 terms) = ( 6 * n * n - 4 * n - 2)
= ( 6 * 4 * 4 - 4 * 4 - 2)
=  78
Input: N = 10
Output: 557


## 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  // 0, 14, 40, 78, 124 ...  #include  #include  using namespace std;     // calculate sum upto Nth term of series  int nthTerm(int n)  {      return 6 * pow(n, 2) - 4 * n - 2;  }     // Driver code  int main()  {      int N = 4;         cout << nthTerm(N);         return 0;  }

## Java

 // Java program to find the N-th term of the series  // 0, 14, 40, 78, 124 ...  import java.util.*;  class solution  {     // calculate sum up to Nth term of series  static int nthTerm(int n)  {         //return the final sum      return 6 * (int)Math.pow(n, 2) - 4 * n - 2;  }     // Driver code  public static void main(String arr[])  {      int N = 4;         System.out.println(nthTerm(N));     }  }  //This code is contributed by Surendra_Gangwar

## Python3

 # Python3 program to find   # the N-th term of the series  # 0, 14, 40, 78, 124 ...     # calculate sum upto Nth   # term of series  def nthTerm(n):      return int(6 * pow(n, 2) - 4 * n - 2)     # Driver code  N = 4 print(nthTerm(N))     # This code is contributed   # by Shrikant13

## C#

 // C# program to find the   // N-th term of the series  // 0, 14, 40, 78, 124 ...  using System;     class GFG  {     // calculate sum up to Nth   // term of series  static int nthTerm(int n)  {         //return the final sum      return 6 * (int)Math.Pow(n, 2) -                           4 * n - 2;  }     // Driver code  public static void Main()  {      int N = 4;         Console.WriteLine(nthTerm(N));  }  }     // This code is contributed   // by inder_verma

## PHP

 

Output:

78
`

Time Complexity: O(1)

Note: Sum upto n terms of the above series(Sn) is: Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

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.