|
%I #6 Dec 19 2017 02:41:55
%S 0,1,0,1,0,0,1,0,1,1,0,0,0,1,0,0,1,1,0,1,1,1,0,0,0,0,1,0,0,0,1,1,0,0,
%T 1,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,1,
%U 0,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,1,1,0,1,0,0,1,1,1,1,0,1,0,1,1,1,0,1,1,1,1
%N Triangle whose n-th row is the concatenated sequence of all binary Lyndon words of length n in lexicographic order.
%F Row n is a concatenation of A001037(n) Lyndon words with total length A027375(n).
%e Triangle of binary Lyndon words begins:
%e 0,1,
%e 01,
%e 001,011,
%e 0001,0011,0111,
%e 00001,00011,00101,00111,01011,01111,
%e 000001,000011,000101,000111,001011,001101,001111,010111,011111.
%t LyndonQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And]&&Array[RotateRight[q,#]&,Length[q],1,UnsameQ];
%t Table[Select[Tuples[{0,1},n],LyndonQ],{n,5}]
%Y Cf. A000002, A000045, A000358, A001037, A006206, A027375, A059966, A066099, A102659, A228369, A281013, A294859.
%K nonn,tabf
%O 1
%A _Gus Wiseman_, Dec 18 2017
|
