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.
| preparecodinginterview_dot_com | 190 |
| __murugan__ | 173 |
| manvimahajan20 | 140 |
| xiaoyan_yunche | 139 |
| ShameekAgarwal | 116 |
| preparecodinginterview_dot_com | 190 |
| __murugan__ | 173 |
| manvimahajan20 | 166 |
| SoumyaKaushik | 146 |
| arpit_anshuman | 140 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |