Program to find the sum of a Series (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + … + (n*n)

You have been given a series (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + … + (n*n), find out the sum of the series till nth term.
Examples :

Input : n = 3
Output : 14
Explanation : 1 + 1/2^2 + 1/3^3

Input : n = 5
Output : 55
Explanation : (1*1) + (2*2) + (3*3) + (4*4) + (5*5)

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to calculate the following series
#include<iostream>
using namespace std;
  
// Function to calculate the following series
int Series(int n)
{
    int i;
    int sums = 0;
    for (i = 1; i <= n; i++)
        sums += (i * i);
    return sums;
}
  
// Driver Code
int main()
{
    int n = 3;
    int res = Series(n);
    cout<<res<<endl;
}

chevron_right


C

filter_none

edit
close

play_arrow

link
brightness_4
code

// C program to calculate the following series
#include <stdio.h>
  
// Function to calculate the following series
int Series(int n)
{
    int i;
    int sums = 0;
    for (i = 1; i <= n; i++)
        sums += (i * i);
    return sums;
}
  
// Driver Code
int main()
{
    int n = 3;
    int res = Series(n);
    printf("%d", res);
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to calculate the following series
import java.io.*;
class GFG {
  
    // Function to calculate the following series
    static int Series(int n)
    {
        int i;
        int sums = 0;
        for (i = 1; i <= n; i++)
            sums += (i * i);
        return sums;
    }
  
    // Driver Code
    public static void main(String[] args)
    {
        int n = 3;
        int res = Series(n);
        System.out.println(res);
    }
}

chevron_right


Python

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program to calculate the following series
def Series(n):
    sums = 0
    for i in range(1, n + 1):
        sums += (i * i);
    return sums
  
# Driver Code
n = 3
res = Series(n)
print(res)

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to calculate the following series
using System;
class GFG {
  
    // Function to calculate the following series
    static int Series(int n)
    {
        int i;
        int sums = 0;
        for (i = 1; i <= n; i++)
            sums += (i * i);
        return sums;
    }
  
    // Driver Code
    public static void Main()
    {
        int n = 3;
        int res = Series(n);
        Console.Write(res);
    }
}
  
// This code is contributed by vt_m.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program to calculate
// the following series
  
// Function to calculate the
// following series
function Series($n)
{
    $i;
    $sums = 0;
    for ($i = 1; $i <= $n; $i++)
        $sums += ($i * $i);
    return $sums;
}
  
// Driver Code
$n = 3;
$res = Series($n);
echo($res);
  
// This code is contributed by Ajit.
?>

chevron_right



Output :

14

Time Complexity: O(n)

Please refer below post for O(1) solution.
Sum of squares of first n natural numbers



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.



Improved By : jit_t, SURENDRA_GANGWAR