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!)
A297774 Number of distinct runs in base-6 digits of n. 3
1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 3, 3, 3, 2, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

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

9^9 in base-6: 1,0,2,2,3,5,4,3,3,2,1,3; ten runs, of which 8 are distinct, so that a(9^9) = 8.

MATHEMATICA

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

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

CROSSREFS

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

Sequence in context: A246920 A244964 A096993 * A043533 A043558 A307359

Adjacent sequences:  A297771 A297772 A297773 * A297775 A297776 A297777

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 June 17 00:17 EDT 2021. Contains 345080 sequences. (Running on oeis4.)