This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A296656 #5 Dec 19 2017 02:41:47
%S A296656 1,2,3,1,2,4,1,3,1,1,2,5,2,3,1,4,1,2,2,1,1,3,1,1,1,2,6,2,4,1,5,1,3,2,
%T A296656 1,2,3,1,1,4,1,1,2,2,1,1,1,3,1,1,1,1,2,7,3,4,2,5,2,2,3,1,6,1,4,2,1,3,
%U A296656 3,1,2,4,1,2,2,2,1,2,1,3,1,1,5,1,1,3,2
%N A296656 Triangle whose n-th row is the concatenated sequence of all Lyndon compositions of n in reverse-lexicographic order.
%F A296656 Row n is a concatenation of A059966(n) Lyndon words with total length A000740(n).
%e A296656 Triangle of Lyndon compositions begins:
%e A296656 (1),
%e A296656 (2),
%e A296656 (3),(12),
%e A296656 (4),(13),(112),
%e A296656 (5),(23),(14),(122),(113),(1112),
%e A296656 (6),(24),(15),(132),(123),(114),(1122),(1113),(11112),
%e A296656 (7),(34),(25),(223),(16),(142),(133),(124),(1222),(1213),(115),(1132),(1123),(11212),(1114),(11122),(11113),(111112).
%t A296656 LyndonQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And]&&Array[RotateRight[q,#]&,Length[q],1,UnsameQ];
%t A296656 Table[Sort[Select[Join@@Permutations/@IntegerPartitions[n],LyndonQ],OrderedQ[PadRight[{#2,#1}]]&],{n,7}]
%Y A296656 Cf. A000740, A001037, A001045, A008965, A059966, A060223, A066099, A101211, A102659, A124734, A185700, A228369, A281013, A294859, A296302, A296373.
%K A296656 nonn,tabf
%O A296656 1,2
%A A296656 _Gus Wiseman_, Dec 18 2017