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 A333226 #6 Mar 28 2020 17:46:16
%S A333226 1,2,1,3,2,2,1,4,3,2,2,3,2,2,1,5,4,6,3,6,2,2,2,4,3,2,2,3,2,2,1,6,5,4,
%T A333226 4,3,6,6,3,4,6,2,2,6,2,2,2,5,4,6,3,6,2,2,2,4,3,2,2,3,2,2,1,7,6,10,5,
%U A333226 12,4,4,4,12,3,6,6,3,6,6,3,10,4,6,6,6,2,2
%N A333226 Least common multiple of the n-th composition in standard order.
%C A333226 The k-th composition in standard order (row k of A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again.
%t A333226 stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
%t A333226 Table[LCM@@stc[n],{n,100}]
%Y A333226 The version for binary indices is A271410.
%Y A333226 The version for prime indices is A290103.
%Y A333226 Positions of first appearances are A333225.
%Y A333226 Let q(k) be the k-th composition in standard order:
%Y A333226 - The terms of q(k) are row k of A066099.
%Y A333226 - The sum of q(k) is A070939(k).
%Y A333226 - The product of q(k) is A124758(k).
%Y A333226 - The GCD of q(k) is A326674(k).
%Y A333226 - The LCM of q(k) is A333226(k).
%Y A333226 Cf. A000120, A029931, A048793, A074971, A076078, A233564, A285572, A289508, A289509, A324837, A333227, A333492.
%K A333226 nonn
%O A333226 1,2
%A A333226 _Gus Wiseman_, Mar 26 2020