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

A Octacontagon numberr is class of figurate number. It has 80 – sided polygon called octacontagon. The N-th octacontagon number count’s the 80 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few octacontagonol numbers are

1, 80, 237, 472 …

**Examples:**

Input:N = 2

Output:80

Explanation:

The second octacontagonol number is 80.

Input:N = 3

Output:237

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

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

Below is the implementation of the above approach:

## C++

`// C++ program for above approach ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Finding the nth octacontagon Number ` `int` `octacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(78 * n * n - 76 * n) / 2; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `n = 3; ` ` ` `cout <<` `"3rd octacontagon Number is = "` ` ` `<< octacontagonNum(n); ` ` ` ` ` `return` `0; ` `} ` ` ` `// This code is contributed by shivanisinghss2110 ` |

*chevron_right*

*filter_none*

## C

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

*chevron_right*

*filter_none*

## Java

`// Java program for above approach ` `import` `java.util.*; ` `class` `GFG{ ` ` ` `// Finding the nth octacontagon Number ` `static` `int` `octacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(` `78` `* n * n - ` `76` `* n) / ` `2` `; ` `} ` ` ` `// Driver Code ` `public` `static` `void` `main(String args[]) ` `{ ` ` ` `int` `n = ` `3` `; ` ` ` `System.out.print(` `"3rd octacontagon Number is = "` `+ ` ` ` `octacontagonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by Akanksha_Rai ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program for above approach ` ` ` `# Finding the nth octacontagon number ` `def` `octacontagonNum(n): ` ` ` ` ` `return` `(` `78` `*` `n ` `*` `n ` `-` `76` `*` `n) ` `/` `/` `2` ` ` `# Driver code ` `n ` `=` `3` `print` `(` `"3rd octacontagon Number is = "` `, ` ` ` `octacontagonNum(n)) ` ` ` `# This code is contributed by divyamohan123 ` |

*chevron_right*

*filter_none*

## C#

`// C# program for above approach ` `using` `System; ` `class` `GFG{ ` ` ` `// Finding the nth octacontagon Number ` `static` `int` `octacontagonNum(` `int` `n) ` `{ ` ` ` `return` `(78 * n * n - 76 * n) / 2; ` `} ` ` ` `// Driver Code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 3; ` ` ` `Console.Write(` `"3rd octacontagon Number is = "` `+ ` ` ` `octacontagonNum(n)); ` `} ` `} ` ` ` `// This code is contributed by Akanksha_Rai ` |

*chevron_right*

*filter_none*

**Output:**

3rd octacontagon Number is = 237

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

**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
- Count number of triplets with product equal to given number with duplicates allowed
- Find minimum number to be divided to make a number a perfect square
- Minimum number of distinct powers of 2 required to express a given binary number
- Count number of trailing zeros in Binary representation of a number using Bitset
- Find the largest number smaller than integer N with maximum number of set bits
- Minimum divisor of a number to make the number perfect cube
- Number of times the largest perfect square number can be subtracted from N
- Find smallest possible Number from a given large Number with same count of digits
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Given number of matches played, find number of teams in tournament
- Number of ways to split a binary number such that every part is divisible by 2
- Number of possible permutations when absolute difference between number of elements to the right and left are given
- Minimum number of swaps required to make a number divisible by 60
- Find smallest number formed by inverting digits of given number N
- Largest number dividing maximum number of elements in the array
- Find the minimum number to be added to N to make it a prime number
- Smallest number dividing minimum number of elements in the Array
- Number of distinct ways to represent a number as sum of K unique primes
- Smallest number dividing minimum number of elements in the array | Set 2