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