I'm trying to golf my reference implementation for the [binary square diagonals sequence](https://codegolf.stackexchange.com/questions/145421/the-binary-square-diagonal-sequence) challenge.
Any ideas for a shorter way to get the concatenated binary numbers than `b 0=[];b x=b(div x 2)++[mod x 2]` and then `(b=<<[1..])` ?
Any ideas for a shorter way to get the concatenated binary numbers than `b 0=[];b x=b(div x 2)++[mod x 2]` and then `(b=<<[1..])` ?
