程序来找到系列0、9、22、39、60、85、114、147，…的Nth项。

给定数字N。任务是编写一个程序来查找以下系列的第N个术语：

0, 9, 22, 39, 60, 85, 114, 147…..(N Terms)

例子：

Input: N = 4
Output: 39
For N = 4
4th Term = ( 2 * 4 * 4 + 3 * 4 - 5) 
         = 39

Input: N = 10
Output: 224

方法：本系列的广义第N个术语：

$nth\: Term\: of\: the\: series\: = 2*n^2+3*n-5$

以下是所需的实现：

C++

// C++ program to find the N-th term of the series:
// 0, 9, 22, 39, 60, 85, 114, 147.....
#include 
#include 
using namespace std;
 
// calculate Nth term of series
int nthTerm(int n)
{
    return 2 * pow(n, 2) + 3 * n - 5;
}
 
// Driver code
int main()
{
    int N = 4;
 
    cout << nthTerm(N) << endl;
 
    return 0;
}

Java

// Java program to find the N-th term of the series:
// 0, 9, 22, 39, 60, 85, 114, 147.....
 
public class GFG {
     
    // calculate Nth term of series
    static int nthTerm(int n)
    {
        return 2 * (int)Math.pow(n, 2) + 3 * n - 5;
    }
       
    // Driver code
    public static void main(String args[])
    {
        int N = 4;
           
       System.out.println(nthTerm(N));
     
    }
    // This Code is contributed by ANKITRAI1
}

Python3

# Python3 program to find the
# N-th term of the series:
# 0, 9, 22, 39, 60, 85, 114, 147.....
 
# calculate Nth term of series
def nthTerm(n):
 
    return 2 * pow(n, 2) + 3 * n - 5
 
# Driver code
N = 4
print(nthTerm(N))
 
# This code is contributed by
# Sanjit_Prasad

C#

// C# program to find the
// N-th term of the series:
// 0, 9, 22, 39, 60, 85, 114, 147.....
using System;
 
class GFG
{
 
// calculate Nth term of series
static int nthTerm(int n)
{
    return 2 * (int)Math.Pow(n, 2) +
                        3 * n - 5;
}
 
// Driver code
public static void Main()
{
    int N = 4;
     
    Console.WriteLine(nthTerm(N));
}
}
 
// This Code is contributed
// by Akanksha Rai(Abby_akku)

Javascript

// JavaScript program to find the N-th term of the series:
// 0, 9, 22, 39, 60, 85, 114, 147.....
 
// calculate Nth term of series
function nthTerm( n)
{
    return 2 * Math.pow(n, 2) + 3 * n - 5;
}
 
// Driver code
 
    let N = 4;
 
    document.write(nthTerm(N));
 
// This code contributed by gauravrajput1
 

输出：

39

时间复杂度： O(1)