Program for centered nonagonal number

Centered nonagonal number is a centered figurate number that represents a nonagon with a dot in the center and all other dots surrounding to the center dot in successive nonagonal layers.

The centered nonagonal number for n is given by
Centered nonagonal number = (3 * n – 2) * (3 * n – 1) / 2;
https://en.wikipedia.org/wiki/Centered_nonagonal_number

Examples :

Input : n = 10
Output : 406

Input : n = 8
Output : 253

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP Program to find
// nth centered nonagonal number.
#include <bits/stdc++.h>
using namespace std;
  
// Function to find nth
// centered nonagonal number.
int centeredNonagonal(int n)
{
    // Formula to find nth centered
    // nonagonal number.
    return (3 * n - 2) * (3 * n - 1) / 2;
}
  
// Driver function.
int main()
{
    int n = 10;
    cout << centeredNonagonal(n);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program to find
// nth centered nonagonal number.
import java.io.*;
  
class GFG {
      
    // Function to find nth
    // centered nonagonal number.
    static int centeredNonagonal(int n)
    {
        // Formula to find nth centered
        // nonagonal number.
        return (3 * n - 2) * (3 * n - 1) / 2;
    }
      
    // Driver function.
    public static void main(String args[])
    {
        int n = 10;
        System.out.println(centeredNonagonal(n));
    }
}
  
// This code is contributed by Nikita Tiwari.

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python 3 Program to find
# nth centered nonagonal number.
  
# Function to find nth
# centered nonagonal number
def centeredNonagonal(n) :
      
    # Formula to find nth centered
    # nonagonal number.
    return (3 * n - 2) * (3 * n - 1) // 2
      
# Driver function.
n = 10
print(centeredNonagonal(n))
  
# This code is contributed 
# by Nikita Tiwari.

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# Program to find nth
// centered nonagonal number.
using System;
  
class GFG {
      
    // Function to find nth
    // centered nonagonal number.
    static int centeredNonagonal(int n)
    {
        // Formula to find nth centered
        // nonagonal number.
        return (3 * n - 2) * (3 * n - 1) / 2;
    }
      
    // Driver function.
    public static void Main()
    {
        int n = 10;
        Console.Write(centeredNonagonal(n));
    }
}
  
// This code is contributed by vt_m.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP Program to find nth 
// centered nonagonal number.
  
// Function to find nth
// centered nonagonal number.
function centeredNonagonal( $n)
{
      
    // Formula to find nth centered
    // nonagonal number.
    return (3 * $n - 2) * 
           (3 * $n - 1) / 2;
}
  
    // Driver Code
    $n = 10;
    echo centeredNonagonal($n);
      
// This code is contributed by anuj_67.
?>

chevron_right



Output:

406

Given a number n, find centered nonagonal number series till n.
We can also find the centered nonagonal number series. centered nonagonal number series contains the points on centered nonagonal.
centered nonagonal number : 1, 10, 28, 55, 91, 136, 190, 253, 325, 406, 496, 595, 703, 820, 946 . . .

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP Program find first
// n centered nonagonal number.
#include <bits/stdc++.h>
using namespace std;
  
// Function to find centered
// nonagonal number series.
int centeredNonagonal(int n)
{
    for (int i = 1; i <= n; i++) {
        cout << (3 * i - 2) * (3 * i - 1) / 2;
        cout << " ";
    }
}
  
// Driver function.
int main()
{
    int n = 10;
    centeredNonagonal(n);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java Program find first
// n centered nonagonal number.
import java.io.*;
  
class GFG {
      
    // Function to find centered
    // nonagonal number series.
    static void centeredNonagonal(int n)
    {
        for (int i = 1; i <= n; i++) 
        {
            System.out.print((3 * i - 2) * 
                             (3 * i - 1) / 2);
            System.out.print(" ");
        }
    }
  
    // Driver function.
    public static void main(String args[])
    {
        int n = 10;
        centeredNonagonal(n);
    }
}
  
// This code is contributed 
// by Nikita Tiwari.

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 Program find first
# n centered nonagonal number
  
# Function to find centered
# nonagonal number series
def centeredNonagonal(n) :
      
    for i in range(1, n + 1) :
        print( (3 * i - 2) * (3 * i - 1) // 2, end=" ")
          
  
# Driver function
n = 10
centeredNonagonal(n)
  
# This code is contributed by Nikita Tiwari

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# Program find first
// n centered nonagonal number.
using System;
  
class GFG {
      
    // Function to find centered
    // nonagonal number series.
    static void centeredNonagonal(int n)
    {
        for (int i = 1; i <= n; i++) 
        {
            Console.Write((3 * i - 2) * 
                            (3 * i - 1) / 2);
                              
            Console.Write(" ");
        }
    }
  
    // Driver function.
    public static void Main()
    {
        int n = 10;
        centeredNonagonal(n);
    }
}
  
// This code is contributed by
// by vt_m.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP Program find first
// n centered nonagonal number.
  
// Function to find centered
// nonagonal number series.
function centeredNonagonal( $n)
{
    for ( $i = 1; $i <= $n; $i++) 
    {
        echo (3 * $i - 2) * 
             (3 * $i - 1) / 2;
        echo " ";
    }
}
  
// Driver Code
$n = 10;
centeredNonagonal($n);
  
// This code is contributed anuj_67.
?>

chevron_right



Output :

1  10  28  55  91  136  190  253  325  406


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 : vt_m