Hexacontatetragon numbers
Last Updated :
13 Jul, 2021
Given a number N, the task is to find Nth Hexacontatetragon number.
An Hexacontatetragon number is a class of figurate numbers. It has a 64-sided polygon called Hexacontatetragon. The N-th Hexacontatetragon number count’s the 64 number of dots and all other dots are surrounding with a common sharing corner and make a pattern. The first few Hexacontatetragonol numbers are 1, 64, 189, 376, 625, 936, …
Examples:
Input: N = 2
Output: 64
Explanation:
The second Hexacontatetragonol number is 64.
Input: N = 3
Output: 189
Approach: The N-th Hexacontatetragon number is given by the formula:
- Nth term of s sided polygon =
- Therefore Nth term of 64 sided polygon is
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int HexacontatetragonNum( int n)
{
return (62 * n * n - 60 * n) / 2;
}
int main()
{
int n = 3;
cout << HexacontatetragonNum(n);
return 0;
}
|
Java
class GFG{
static int HexacontatetragonNum( int n)
{
return ( 62 * n * n - 60 * n) / 2 ;
}
public static void main(String[] args)
{
int n = 3 ;
System.out.print(HexacontatetragonNum(n));
}
}
|
Python3
def HexacontatetragonNum(n):
return ( 62 * n * n - 60 * n) / 2 ;
n = 3 ;
print (HexacontatetragonNum(n));
|
C#
using System;
class GFG{
static int HexacontatetragonNum( int n)
{
return (62 * n * n - 60 * n) / 2;
}
public static void Main()
{
int n = 3;
Console.Write(HexacontatetragonNum(n));
}
}
|
Javascript
<script>
function HexacontatetragonNum( n) {
return (62 * n * n - 60 * n) / 2;
}
let n = 3;
document.write(HexacontatetragonNum(n));
</script>
|
Time Complexity: O(1)
Reference: https://en.wikipedia.org/wiki/Hexacontatetragon
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...