Dyck language interpreted as binary numbers in ascending order.

Terms

a(0) =0a(1) =10a(2) =1010a(3) =1100a(4) =101010a(5) =101100a(6) =110010a(7) =110100a(8) =111000a(9) =10101010a(10) =10101100a(11) =10110010a(12) =10110100a(13) =10111000a(14) =11001010a(15) =11001100a(16) =11010010a(17) =11010100a(18) =11011000a(19) =11100010a(20) =11100100a(21) =11101000a(22) =11110000a(23) =1010101010a(24) =1010101100a(25) =1010110010a(26) =1010110100a(27) =1010111000