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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297773 Number of distinct runs in base-5 digits of n. 3
 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 3, 3, 3, 2, 1, 2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 1, 2, 2, 3, 3, 2, 2, 3, 3, 3, 2, 3, 2, 2, 3, 3, 2, 3, 3, 2, 3, 2, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 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 8^8 in base 5: 1,3,2,4,3,3,3,2,3,3,1; eight runs, of which 6 are distinct, so that a(8^8) = 6. MATHEMATICA b = 5; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]] Table[s[n], {n, 1, 200}] CROSSREFS Cf. A043557 (number of runs, not necessarily distinct), A297770, A043532. Sequence in context: A080462 A194823 A098396 * A043532 A043557 A055027 Adjacent sequences:  A297770 A297771 A297772 * A297774 A297775 A297776 KEYWORD nonn,base,easy AUTHOR Clark Kimberling, Jan 27 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 June 17 00:17 EDT 2021. Contains 345080 sequences. (Running on oeis4.)