Given a number n, the task is to find all 1 to n bit numbers with no consecutive 1's in their binary representation.
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:
Print all those numbers in new line.
Constraints:
1<=T<=20
1<=n<=20
Example:
Input:
2
3
4
Output:
1 2 4 5
1 2 4 5 8 9 10
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.
| cs_abhi | 62 |
| kya_bolti_public | 56 |
| Shubhankar Sharma | 44 |
| vermaankush14291 | 42 |
| coderquill | 40 |
| PiyushPandey4 | 856 |
| john_wick | 757 |
| ASWATHAMA | 565 |
| akhyasharma01 | 547 |
| UsfShilpa | 536 |
| blackshadows | 5362 |
| Ibrahim Nash | 5242 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4598 |