Sum of all subsets formed by first N natural numbers
Submissions: 380   Accuracy:

36.06%

  Difficulty: Basic   Marks: 1

Given a number N, the task is to find the sum of all the elements from all possible subsets of a set formed by first N natural numbers.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N as input.

Output:
For each test case, print the sum in new line.

Constraints:
1 <= T <= 50
1 <= N <= 50

Example:
Input:
2

2
3

Output:
6
24

Explanation:

Input :  n = 2
Output : 6
Possible subsets are {{1}, {2}, 
{1, 2}}. Sum of elements in subsets
is 1 + 2 + 1 + 2 = 6.

** For More Input/Output Examples Use 'Expected Output' option **

Author: arun03


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.