Given a number n, the task is to find the nth Hendecagonal number.
A Hendecagonal number is a figurate number that extends the concept of triangular and square numbers to the decagon (Eleven -sided polygon). The nth hendecagonal number counts the number of dots in a pattern of n nested decagons, all sharing a common corner, where the ith hendecagon in the pattern has sides made of i dots spaced one unit apart from each other.
Input : 2
Formula for nth hendecagonal number :
3th Hendecagonal number: 30 10th Hendecagonal number: 415
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.
- Program to check if N is a Hendecagonal Number
- Number of factors of very large number N modulo M where M is any prime 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
- Find minimum number to be divided to make a number a perfect square
- Count number of triplets with product equal to given number with duplicates allowed
- Minimum number of distinct powers of 2 required to express a given binary number
- Smallest number dividing minimum number of elements in the array | Set 2
- Find smallest possible Number from a given large Number with same count of digits
- Previous perfect square and cube number smaller than number N
- Largest number dividing maximum number of elements in the array
- Smallest number dividing minimum number of elements in the Array
- Find the number of positive integers less than or equal to N that have an odd number of digits
- Number of ways to split a binary number such that every part is divisible by 2
- Minimum divisor of a number to make the number perfect cube
- Given number of matches played, find number of teams in tournament
- Find the minimum number to be added to N to make it a prime number
- Number of distinct ways to represent a number as sum of K unique primes
- Minimum number of swaps required to make a number divisible by 60
- Number of times the largest perfect square number can be subtracted from N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.
Improved By : jit_t