n-ésimo término de la serie 2, 12, 36, 80, 150….

Dada una serie 2, 12, 36, 80, 150… Encuentra el término n-ésimo de la serie.
Ejemplos: 
 

Input : 2
Output : 12

Input : 4
Output : 80 

Si miramos más de cerca, podemos notar que la serie es suma de cuadrados y cubos de números naturales (1, 4, 9, 16, 25, …..) + (1, 8, 27, 64, 125, …. ).
Por lo tanto, el n-ésimo número de la serie es n^2 + n^3 
 

// CPP program to find n-th term of
// the series  2, 12, 36, 80, 150, ..
#include <iostream>
using namespace std;
 
// Returns n-th term of the series
// 2, 12, 36, 80, 150
int nthTerm(int n)
{
    return (n * n) + (n * n * n);
}
 
// driver code
int main()
{
    int n = 4;
    cout << nthTerm(n);
    return 0;
}

//java program to find n-th term of
// the series 2, 12, 36, 80, 150, ..
import java.util.*;
 
class GFG
{
    // Returns n-th term of the series
    // 2, 12, 36, 80, 150
    public static int nthTerm(int n)
    {
        return (n * n) + (n * n * n);
    }
     
    // Driver code
    public static void main(String[] args)
    {
        int n = 4;
        System.out.print(nthTerm(n));
    }
}
 
// This code is contributed by rishabh_jain

# Python3 code to find n-th term of
# the series 2, 12, 36, 80, 150, ..
 
# Returns n-th term of the series
# 2, 12, 36, 80, 150
def nthTerm( n ):
    return (n * n) + (n * n * n)
 
# driver code
n = 4
print( nthTerm(n))
 
# This code is contributed
# by "Sharad_Bhardwaj".

// C# program to find n-th term of
// the series 2, 12, 36, 80, 150, ..
using System;
 
class GFG
{
    // Returns n-th term of the series
    // 2, 12, 36, 80, 150
    public static int nthTerm(int n)
    {
        return (n * n) + (n * n * n);
    }
     
    // Driver code
    public static void Main()
    {
        int n = 4;
        Console.WriteLine(nthTerm(n));
    }
}
 
// This code is contributed by vt_m.

<?php
// PHP program to find n-th term of
// the series 2, 12, 36, 80, 150, ..
 
// Returns n-th term of the series
// 2, 12, 36, 80, 150
function nthTerm($n)
{
    return ($n * $n) + ($n * $n * $n);
}
 
// driver code
$n = 4;
echo(nthTerm($n));
 
// This code is contributed by Ajit.
?>

<script>
// Javascript program to find n-th term of
// the series 2, 12, 36, 80, 150, ..
 
// Returns n-th term of the series
// 2, 12, 36, 80, 150
function nthTerm(n)
{
    return (n * n) + (n * n * n);
}
 
// driver code
let n = 4;
document.write(nthTerm(n));
 
// This code is contributed by gfgking
</script>

Producción : 
 

80

Complejidad de tiempo: O (1) ya que solo se requiere un paso para calcular el término n de la fórmula dada

Espacio Auxiliar: O(1)