Programa para hallar el N-ésimo término de la serie 0, 5, 18, 39, 67, 105, 150, 203,…

Dado un número N. La tarea es escribir un programa para encontrar el N-ésimo término de la siguiente serie:
 

0, 5, 18, 39, 67, 105, 150, 203, …(Términos N)

Ejemplos: 
 

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

Input: N = 10
Output: 332

Enfoque: El enésimo término generalizado de esta serie: 
 

A continuación se muestra la implementación requerida: 
 

// CPP program to find the N-th term of the series:
// 0, 5, 18, 39, 67, 105, 150, 203, ...
#include <iostream>
#include <math.h>
using namespace std;
 
// calculate Nth term of series
int nthTerm(int n)
{
    return 4 * pow(n, 2) - 7 * n + 3;
}
 
// Driver code
int main()
{
    int N = 4;
 
    cout << nthTerm(N);
 
    return 0;
}

// Java program to find the N-th term of the series:
// 0, 5, 18, 39, 67, 105, 150, 203,
 
import java.util.*;
import java.lang.*;
import java.io.*;
 
class GFG
{
// calculate Nth term of series
static int nthTerm(int n)
{
    return 4 * (int)Math.pow(n, 2) - 7 * n + 3;
}
   
// Driver code
public static void  main(String args[])
{
    int N = 4;
   
    System.out.print(nthTerm(N));
}
}

# Python 3 program to find the
# N-th term of the series:
# 0, 5, 18, 39, 67, 105, 150, 203, ...
 
# calculate Nth term of series
def nthTerm(n):
 
    return 4 * pow(n, 2) - 7 * n + 3
 
# Driver code
N = 4
 
print(nthTerm(N))
 
# This code is contributed by ash264

// C# program to find the
// N-th term of the series:
// 0, 5, 18, 39, 67, 105, 150, 203,
using System;
 
class GFG
{
// calculate Nth term of series
static int nthTerm(int n)
{
    return 4 * (int)Math.Pow(n, 2) -
                        7 * n + 3;
}
 
// Driver code
static public void Main ()
{
    int N = 4;
 
    Console.Write(nthTerm(N));
}
}
 
// This code is contributed by Raj

<?php
// PHP program to find the
// N-th term of the series:
// 0, 5, 18, 39, 67, 105, 150, 203, ...
 
// calculate Nth term of series
function nthTerm($n)
{
    return 4 * pow($n, 2) -
           7 * $n + 3;
}
 
// Driver code
$N = 4;
 
echo nthTerm($N);
 
// This code is contributed
// by Akanksha Rai(Abby_akku)
?>

<script>
 
// JavaScript program to find the N-th term of the series:
// 0, 5, 18, 39, 67, 105, 150, 203, ...
 
// calculate Nth term of series
function nthTerm( n)
{
    return 4 * Math.pow(n, 2) - 7 * n + 3;
}
// driver code
  // declaration of number of terms
   let N = 4;
   document.write( nthTerm(N) );
 
// This code contributed by gauravrajput1
 
</script>

39

Complejidad de tiempo: O(1)

Complejidad espacial : O (1) ya que usa variables constantes