Magical Sequence

CodeChefOpen on judge ↗

You are given a sequence 15, 29, 56, 108, 208,... and a number N. The task is to find Nth term of this sequence. Input First line contains T, the number of test cases. Each test case contains one integer N. Output For each test case print Nth term of series in new line. Constraints - 1 ≤ T ≤ 100 - 1 ≤ N ≤ 20 Example Input: 3 1 2 3 Output: 15 29 56

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI