login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Least common multiple of the n-th composition in standard order.
14

%I #6 Mar 28 2020 17:46:16

%S 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 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 12,4,4,4,12,3,6,6,3,6,6,3,10,4,6,6,6,2,2

%N Least common multiple of the n-th composition in standard order.

%C 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 stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;

%t Table[LCM@@stc[n],{n,100}]

%Y The version for binary indices is A271410.

%Y The version for prime indices is A290103.

%Y Positions of first appearances are A333225.

%Y Let q(k) be the k-th composition in standard order:

%Y - The terms of q(k) are row k of A066099.

%Y - The sum of q(k) is A070939(k).

%Y - The product of q(k) is A124758(k).

%Y - The GCD of q(k) is A326674(k).

%Y - The LCM of q(k) is A333226(k).

%Y Cf. A000120, A029931, A048793, A074971, A076078, A233564, A285572, A289508, A289509, A324837, A333227, A333492.

%K nonn

%O 1,2

%A _Gus Wiseman_, Mar 26 2020