login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297770 Number of distinct runs in base-2 digits of n. 55
1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 2, 1, 2, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 1, 2, 2, 3, 3, 2, 3, 4, 3, 3, 3, 2, 3, 4, 3, 3, 3, 2, 3, 4, 2, 4, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 1, 2, 2, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 4, 4, 3, 3, 3, 3, 4, 3, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Every positive integers occurs infinitely many times.
***
Guide to related sequences:
Base b # runs # distinct runs
LINKS
EXAMPLE
27 in base-2: 1,1,0,1,1; three runs, of which 2 are distinct: 0 and 11, so that a(27) = 2.
MATHEMATICA
b = 2; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]
CROSSREFS
Cf. A005811 (number of runs, not necessarily distinct).
Sequence in context: A160520 A235708 A353929 * A330617 A343240 A145866
KEYWORD
nonn,base,easy
AUTHOR
Clark Kimberling, Jan 26 2018
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 16:44 EST 2023. Contains 367563 sequences. (Running on oeis4.)