Given a number **N**, the task is to find **N ^{th}** Icosioctagon number.

An Icosioctagon number is class of figurate number. It has 28 – sided polygon called icosikaioctagon. The N-th icosikaioctagonal number count’s the 28 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few icosikaioctagonol numbers are

1, 28, 81, 160 …

**Examples:**

Input:N = 2

Output:28

Explanation:

The second icosikaioctagonol number is 28.

Input:N = 3

Output:81

**Approach:** The N-th icosikaioctagonal number is given by the formula:

- Nth term of s sided polygon =
- Therefore Nth term of 28 sided polygon is

Below is the implementation of the above approach:

## C++

`// C++ program for above approach ` `#include <iostream> ` `using` `namespace` `std; ` ` ` `// Finding the nth icosikaioctagonal number ` `int` `icosikaioctagonalNum(` `int` `n) ` `{ ` ` ` `return` `(26 * n * n - 24 * n) / 2; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` ` ` `cout << ` `"3rd icosikaioctagonal Number is = "` ` ` `<< icosikaioctagonalNum(n); ` ` ` ` ` `return` `0; ` `} ` ` ` `// This code is contributed by shubhamsingh10 ` |

*chevron_right*

*filter_none*

## C

`// C program for above approach ` `#include <stdio.h> ` `#include <stdlib.h> ` ` ` `// Finding the nth icosikaioctagonal Number ` `int` `icosikaioctagonalNum(` `int` `n) ` `{ ` ` ` `return` `(26 * n * n - 24 * n) / 2; ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `printf` `(` `"3rd icosikaioctagonal Number is = %d"` `, ` ` ` `icosikaioctagonalNum(n)); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program for above approach ` `class` `GFG{ ` ` ` `// Finding the nth icosikaioctagonal number ` `public` `static` `int` `icosikaioctagonalNum(` `int` `n) ` `{ ` ` ` `return` `(` `26` `* n * n - ` `24` `* n) / ` `2` `; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `n = ` `3` `; ` ` ` `System.out.println(` `"3rd icosikaioctagonal Number is = "` `+ ` ` ` `icosikaioctagonalNum(n)); ` `} ` `} ` ` ` `// This code is contributed by divyeshrabadiya07 ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program for above approach ` ` ` `# Finding the nth icosikaioctagonal Number ` `def` `icosikaioctagonalNum(n): ` ` ` ` ` `return` `(` `26` `*` `n ` `*` `n ` `-` `24` `*` `n) ` `/` `/` `2` ` ` `# Driver Code ` `n ` `=` `3` `print` `(` `"3rd icosikaioctagonal Number is = "` `, ` ` ` `icosikaioctagonalNum(n)) ` ` ` `# This code is contributed by divyamohan123 ` |

*chevron_right*

*filter_none*

## C#

`// C# program for above approach ` `using` `System; ` `class` `GFG{ ` ` ` `// Finding the nth icosikaioctagonal number ` `public` `static` `int` `icosikaioctagonalNum(` `int` `n) ` `{ ` ` ` `return` `(26 * n * n - 24 * n) / 2; ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 3; ` ` ` `Console.Write(` `"3rd icosikaioctagonal Number is = "` `+ ` ` ` `icosikaioctagonalNum(n)); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

3rd icosikaioctagonal Number is = 81

**Reference:** https://en.wikipedia.org/wiki/Icosioctagon

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Number of factors of very large number N modulo M where M is any prime number
- Find minimum number to be divided to make a number a perfect square
- How to check if a given number is Fibonacci number?
- Find the smallest number whose digits multiply to a given number n
- Find n'th number in a number system with only 3 and 4
- Build Lowest Number by Removing n digits from a given number
- Count number of subsets of a set with GCD equal to a given number
- Count number of ways to divide a number in 4 parts
- Querying maximum number of divisors that a number in a given range has
- Check if a number is a power of another number
- Find the Largest number with given number of digits and sum of digits
- Finding number of digits in n'th Fibonacci number
- Smallest number by rearranging digits of a given number
- Number with maximum number of prime factors
- Convert a number m to n using minimum number of given operations
- Determine whether a given number is a Hyperperfect Number
- Find count of digits in a number that divide the number
- Convert a binary number to hexadecimal number
- Number of times the largest perfect square number can be subtracted from N
- Find if a number is divisible by every number in a list

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.