« first day (15 days earlier)   

9:21 PM
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..])` ?
So far I am at 167 bytes: Try it online!
(Btw. why is the markdown in the first message broken?)
 
@Laikoni No Markdown in multiline messages
 
@Mego Good to know.
I tried snd.span(<1)=<<mapM(\_->[0,1])[0..n]to generate the sequence of binary numbers, but this only works for some given n.
 

« first day (15 days earlier)