Centered tridecagonal number
Last Updated :
20 May, 2022
Given a number n, the task is to find the nth Centered Tridecagonal Number.
A Centered tridecagonal number represents a dot at the center and other dots surrounding the center dot
in the successive tridecagonal(13 sided polygon) layer.
Examples :
Input : 2
Output : 14
Input : 9
Output : 469
Formula for nth Centered tridecagonal number:
C++
#include <bits/stdc++.h>
using namespace std;
int centeredTridecagonalNum( long int n)
{
return (13 * n * (n - 1) + 2) / 2;
}
int main()
{
long int n = 3;
cout << centeredTridecagonalNum(n);
cout << endl;
n = 10;
cout << centeredTridecagonalNum(n);
return 0;
}
|
C
#include <stdio.h>
int centeredTridecagonalNum( long int n)
{
return (13 * n * (n - 1) + 2) / 2;
}
int main()
{
long int n = 3;
printf ( "%d\n" ,centeredTridecagonalNum(n));
n = 10;
printf ( "%d\n" ,centeredTridecagonalNum(n));
return 0;
}
|
Java
import java.io.*;
class GFG
{
static long centeredTridecagonalNum( long n)
{
return ( 13 * n * (n - 1 ) + 2 ) / 2 ;
}
public static void main (String[] args)
{
long n = 3 ;
System.out.println(centeredTridecagonalNum(n));
n = 10 ;
System.out.println(centeredTridecagonalNum(n));
}
}
|
Python3
def centeredTridecagonalNum(n) :
return ( 13 * n *
(n - 1 ) + 2 ) / / 2
if __name__ = = '__main__' :
n = 3
print (centeredTridecagonalNum(n))
n = 10
print (centeredTridecagonalNum(n))
|
C#
using System;
class GFG
{
static long centeredTridecagonalNum( long n)
{
return (13 * n * (n - 1) + 2) / 2;
}
public static void Main ()
{
long n = 3;
Console.WriteLine(centeredTridecagonalNum(n));
n = 10;
Console.WriteLine(centeredTridecagonalNum(n));
}
}
|
PHP
<?php
function centeredTridecagonalNum( $n )
{
return (13 * $n *
( $n - 1) + 2) / 2;
}
$n = 3;
echo centeredTridecagonalNum( $n );
echo "\n" ;
$n = 10;
echo centeredTridecagonalNum( $n );
?>
|
Javascript
<script>
function centeredTridecagonalNum(n)
{
return (13 * n * (n - 1) + 2) / 2;
}
var n = 3;
document.write(centeredTridecagonalNum(n) + "<br>" );
n = 10;
document.write(centeredTridecagonalNum(n));
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Reference: http://oeis.org/wiki/Figurate_numbers
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...