Heptadecagonal number
Last Updated :
19 May, 2022
Given a number n, the task is to find the nth heptadecagonal number .
A heptadecagonal number is a class of figurate numbers. It has a seventeen-sided polygon called heptadecagon. The n-th heptadecagonal number count’s the seventeen number of dots and all other dots are surrounding with a common sharing corner and make a pattern.
Examples:
Input : 5
Output :155
Input :9
Output :549
Formula to calculate nth heptadecagonal number:
C++
#include <iostream>
using namespace std;
int heptadecagonalNum( long int n)
{
return ((15 * n * n) - 13 * n) / 2;
}
int main()
{
long int n = 3;
cout << n << "th Heptadecagonal number : " ;
cout << heptadecagonalNum(n);
cout << endl;
n = 8;
cout << n << "th Heptadecagonal number : " ;
cout << heptadecagonalNum(n);
return 0;
}
|
C
#include <stdio.h>
int heptadecagonalNum( long int n)
{
return ((15 * n * n) - 13 * n) / 2;
}
int main()
{
long int n = 3;
printf ( "%ldth Heptadecagonal number : " ,n);
printf ( "%d\n" ,heptadecagonalNum(n));
n = 8;
printf ( "%ldth Heptadecagonal number : " ,n);
printf ( "%d\n" ,heptadecagonalNum(n));
return 0;
}
|
Java
import java.io.*;
class GFG {
static long heptadecagonalNum( long n)
{
return (( 15 * n * n) - 13 * n) / 2 ;
}
public static void main (String[] args)
{
long n = 3 ;
System.out.print( n + "th Heptadecagonal"
+ " number : " );
System.out.println( heptadecagonalNum(n));
n = 8 ;
System.out.print( n + "th Heptadecagonal"
+ " number : " );
System.out.print( heptadecagonalNum(n));
}
}
|
Python3
def heptadecagonalNum(n):
return (( 15 * n * n) - 13 * n) / / 2
n = 3
print ( "%sth Heptadecagonal number : " % n,
heptadecagonalNum(n))
n = 8
print ( "%sth Heptadecagonal number: " % n,
heptadecagonalNum(n))
|
C#
using System;
class GFG {
static long heptadecagonalNum( long n)
{
return ((15 * n * n) -
13 * n) / 2;
}
public static void Main ()
{
long n = 3;
Console.Write( n + "th Heptadecagonal"
+ " number : " );
Console.WriteLine( heptadecagonalNum(n));
n = 8;
Console.Write( n + "th Heptadecagonal"
+ " number : " );
Console.WriteLine( heptadecagonalNum(n));
}
}
|
PHP
<?php
function heptadecagonalNum( $n )
{
return ((15 * $n * $n ) -
13 * $n ) / 2;
}
$n = 3;
echo $n , "th Heptadecagonal number : " ;
echo heptadecagonalNum( $n );
echo "\n" ;
$n = 8;
echo $n , "th Heptadecagonal number : " ;
echo heptadecagonalNum( $n );
?>
|
Javascript
<script>
function heptadecagonalNum(n)
{
return ((15 * n * n) - 13 * n) / 2;
}
let n = 3;
document.write( n + "th Heptadecagonal" + " number : " );
document.write( heptadecagonalNum(n) + "</br>" );
n = 8;
document.write( n + "th Heptadecagonal" + " number : " );
document.write( heptadecagonalNum(n));
</script>
|
Output
3th Heptadecagonal number : 48
8th Heptadecagonal number : 428
Time Complexity: O(1)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...