 Recaman’s sequence
##### Submissions: 1478   Accuracy: 42.6%   Difficulty: Easy   Marks: 2

Given an integer n. Print first n elements of Recaman’s sequence.
It is basically a function with domain and co-domain as natural numbers and 0. It is recursively defined as below:
Specifically, let a(n) denote the (n+1)-th term. (0 being already there).
The rule says:

```a(0) = 0,
if n > 0 and the number is not
a(n) = a(n - 1) - n
else
a(n) = a(n-1) + n.

```

Examples:

```Input : n = 6
Output : 0, 1, 3, 6, 2, 7

Input  : n = 17
Output : 0, 1, 3, 6, 2, 7, 13, 20, 12, 21,
11, 22, 10, 23, 9, 24, 8
```

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 an integer N.

Output:
For each test case in a new line print the space separated values of the first n elements of the Recaman's series.

Constraints:
1<=T<=100
1<=N<=100

Example:
Input:

2
3
6
Output:
0 1 3
0 1 3 6 2 7

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

Author: Shubham Joshi 1

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.