C :

#include<stdio.h>
int main()
{
	int i,m,n,s;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		int j;
		s=1;
		scanf("%d",&m);
		for(j=m;j>=1;j--)
			s=(s+1)*2;
		printf("%d\n",s);
	}
	return 0;
}

C++ :

#include<iostream>
using namespace std;
int main()
{
	int n;
	cin>>n;int a[30];a[0]=1;
	for(int r=1;r<=28;r++)
	a[r]=(a[r-1]+1)*2;
	int b[n+1];
	for(int y=1;y<=n;y++)
	cin>>b[y];
	for(int y=1;y<=n;y++)
	{
		cout<<a[b[y]]<<endl;
	}
}

Pascal :

program p(input,output);
 var
 n,t,i:integer;
 a: array[1..35] of longint;
begin
 readln(n);
 while n>0 do
 begin
  readln(t);
  a[t+1]:=1;
  for i:= t downto 1 do
   a[i]:=(a[i+1]+1)*2;
  writeln(a[1]);
  dec(n);
 end;
end.

Java :

import java.util.Scanner;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		while(n-->0)
		{
			int m=sc.nextInt();
			System.out.println(getSums(m));
		}
	}
	public static int getSums(int x)
	{
		int peach=1;
		for(int i=1;i<=x;i++)
		{
			peach=(peach+1)*2;
		}
		return peach;
	}
}