The following numbers form the concentric hexagonal sequence :
0, 1, 6, 13, 24, 37, 54, 73, 96, 121, 150 ……
The number sequence forms a pattern with concentric hexagons, and the numbers denote the number of points required after the n-th stage of the pattern.
Examples:
Input : N = 3
Output : 13Input : N = 4
Output : 24
Approach :
The above series can be referred from Concentric Hexagonal Numbers.
Nth term of the series is 3*n2/2
Below is the implementation of the above approach :
C++
// CPP program to find nth concentric hexagon number#include <bits/stdc++.h>using namespace std;// Function to find nth concentric hexagon numberint concentric_Hexagon(int n){ return 3 * pow(n, 2) / 2;}// Driver codeint main(){ int n = 3; // Function call cout << concentric_Hexagon(n); return 0;} |
Java
// Java program to find// nth concentric hexagon numberclass GFG{ // Function to find // nth concentric hexagon number static int concentric_Haxagon(int n) { return 3 * (int)Math.pow(n, 2) / 2; } // Driver Code public static void main (String[] args) { int n = 3; // Function call System.out.println(concentric_Haxagon(n)); }}// This code is contributed by// sanjeev2552 |
Python3
# Python3 program to find# nth concentric hexagon number # Function to find # nth concentric hexagon numberdef concentric_Hexagon(n): return 3 * pow(n, 2) // 2# Driver coden = 3# Function callprint(concentric_Hexagon(n)) # This code is contributed by Mohit Kumar |
C#
// C# program to find nth concentric hexagon numberusing System;class GFG{// Function to find nth concentric hexagon numberstatic int concentric_Hexagon(int n){ return 3 * (int)Math.Pow(n, 2) / 2;}// Driver codepublic static void Main(){ int n = 3; // Function call Console.WriteLine(concentric_Hexagon(n));}}// This code is contributed by Nidhi |
Javascript
<script>// Javascript program to find// nth concentric hexagon number// Function to find// nth concentric hexagon numberfunction concentric_Haxagon(n) { return parseInt(3 * Math.pow(n, 2) / 2);}// Driver codevar n = 3; // Function calldocument.write(concentric_Haxagon(n)); // This code is contributed by Ankita saini</script> |
Output:
13
Time complexity: O(1) for given n, as it is doing constant operations.
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
