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”).
%I #15 May 10 2014 09:50:08
%S 1,1,1,1,1,2,1,1,1,3,1,3,1,2,1,1,1,4,1,4,1,2,1,4,1,3,1,3,1,2,1,1,1,5,
%T 1,5,1,5,1,5,1,3,1,5,1,2,1,5,1,4,1,4,1,2,1,4,1,3,1,3,1,2,1,1,1,6,1,6,
%U 1,6,1,6,1,3,1,6,1,6,1,6,1,4,1,4,1,2,1,6,1,3,1,3,1,2,1,6,1,5,1,5,1,5,1,5,1,3,1,5,1,2,1,5,1,4,1,4,1,2,1,4,1
%N Length of the smallest (i.e., rightmost) Lyndon word in the Lyndon factorization of the binary representation of n.
%C See A211100 for more details.
%C The length of the largest (or leftmost) Lyndon word in the factorization is always 1.
%H N. J. A. Sloane, <a href="/A211095/a211095.txt">Maple programs</a>
%F a(2k) = 1 always (the only Lyndon word ending in 0 is 0 itself).
%e n=25 has binary expansion 11001, which has Lyndon factorization (1)(1)(001) with three factors. The rightmost factor, 001, has length 3, so a(25)=3.
%Y Cf. A211100, A211096-A211099.
%K nonn
%O 0,6
%A _N. J. A. Sloane_, Mar 31 2012