This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211095 Length of the smallest (i.e., rightmost) Lyndon word in the Lyndon factorization of the binary representation of n. 6
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS See A211100 for more details. The length of the largest (or leftmost) Lyndon word in the factorization is always 1. LINKS N. J. A. Sloane, Maple programs FORMULA a(2k) = 1 always (the only Lyndon word ending in 0 is 0 itself). EXAMPLE 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. CROSSREFS Cf. A211100, A211096-A211099. Sequence in context: A095136 A105540 A057043 * A070091 A091981 A060247 Adjacent sequences:  A211092 A211093 A211094 * A211096 A211097 A211098 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 31 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 16:56 EDT 2019. Contains 324196 sequences. (Running on oeis4.)