Find n-th term in the series 9, 33, 73,129 …

Given a series 9, 33, 73, 129… Find the n-th term of the series.

Examples:

Input : n = 4
Output : 129 

Input : n = 5
Output : 201



The given series has a pattern which is visible after subtracting it from itself after one shift 

S = 9 + 33 + 73 + 129 + … tn-1 + tn
S =     9 + 33 + 73 + … tn-2 + tn-1 + tn
———————————————
0 = 9 + (24 + 40 + 56 + ….) - tn 

Since 24 + 40 + 56.. series in A.P with
common difference of 16, we get

 tn = 9 + [((n-1)/2)*(2*24 + (n-1-1)d)] 

On solving this we get 



 tn = 8n2 + 1

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// Program to find n-th element in the
// series 9, 33, 73, 128..
#include <bits/stdc++.h>
using namespace std;
  
// Returns n-th  element of the series
int series(int n)
{
    return (8 * n * n) + 1;
}
  
// driver program to test the above function
int main()
{
    int n = 5;
    cout << series(n);
    return 0;
}

chevron_right






                        filter_none









Java














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Program to find n-th element in the 


// series 9, 33, 73, 128.. 


import java.io.*; 


  


class GFG{ 


      


    // Returns n-th  element of the series 


    static int series(int n) 


    { 


        return (8 * n * n) + 1; 


    } 


      


    // driver program to test the above 


    // function 


    public static void main(String args[]) 


    { 


        int n = 5; 


        System.out.println(series(n)); 


    } 


} 


  


/*This code is contributed by Nikita Tiwari.*/



















                        chevron_right







                        filter_none









Python3














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















# Python Program to find n-th element  


# in the series 9, 33, 73, 128... 


  


# Returns n-th element of the series 


def series(n): 


    print (( 8 * n ** 2) + 1) 


      


# Driver Code 


series(5) 


  


# This code is contributed by Abhishek Agrawal. 



















                        chevron_right







                        filter_none









C#














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// C# program to find n-th element in the 


// series 9, 33, 73, 128.. 


using System; 


  


class GFG { 


  


    // Returns n-th element of the series 


    static int series(int n) 


    { 


        return (8 * n * n) + 1; 


    } 


  


    // driver function 


    public static void Main() 


    { 


        int n = 5; 


        Console.WriteLine(series(n)); 


    } 


} 


  


/*This code is contributed by vt_m.*/



















                        chevron_right







                        filter_none









PHP














                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















<?php 


// PHP Program to find n-th element  


// in the series 9, 33, 73, 128.. 


  


// Returns n-th element 


// of the series 


function series($n) 


{ 


    return (8 * $n * $n) + 1; 


} 


  


// Driver Code 


$n = 5; 


echo(series($n)); 


  


// This code is contributed by Ajit. 


?> 



















                        chevron_right







                        filter_none










Output:


201



Time complexity: O(1)


This article is contributed by Striver. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



          
          
          
          

            

    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:

Improved By :  jit_t


      
      
      
      

      

      
					
		

    Article Tags : 
Mathematical

           	
Practice Tags : 
Mathematical
series

        

         

         
 
         
        Be the First to upvote.

                

        



        
        
        
        
        

    

            

            1.5
            

            

             
                 Based on 2 vote(s)
                    

            
            
            
            
            
        

        
        

        

        

        

        

        

        


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.