Given a number n, the task is to find all 1 to n bit numbers with no consecutive 1's in their binary representation.
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.
Print all those numbers in new line.
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.