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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297775 Number of distinct runs in base-7 digits of n. 3
1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 3, 3, 3, 3, 2, 1, 2, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

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

1234567 in base-7: 1,3,3,3,1,2,1,5; six runs, of which 4 are distinct, so that a(1234567) = 4.

MATHEMATICA

b = 7; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]

Table[s[n], {n, 1, 200}]

CROSSREFS

Cf. A043559 (number of runs, not necessarily distinct), A297770, A043534.

Sequence in context: A043533 A043558 A307359 * A043534 A043559 A083165

Adjacent sequences:  A297772 A297773 A297774 * A297776 A297777 A297778

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 12:26 EDT 2021. Contains 343740 sequences. (Running on oeis4.)