The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297784 Number of distinct runs in base-16 digits of n. 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,16 COMMENTS Every positive integers occurs infinitely many times.  See A297770 for a guide to related sequences. LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 EXAMPLE 17830144 in base-16: 1,1,0,1,1,0,0; four runs, of which 3 are distinct, so that a(17830144) = 3. MATHEMATICA b = 16; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]] Table[s[n], {n, 1, 200}] CROSSREFS Cf. A043568 (number of runs, not necessarily distinct), A297770. Sequence in context: A297783 A043542 A043567 * A043568 A043543 A237684 Adjacent sequences:  A297781 A297782 A297783 * A297785 A297786 A297787 KEYWORD nonn,base,easy AUTHOR Clark Kimberling, Feb 03 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 09:28 EST 2020. Contains 338833 sequences. (Running on oeis4.)