|
| |
|
|
A297779
|
|
Number of distinct runs in base-11 digits of n.
|
|
3
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,11
|
|
|
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
|
11! in base-11: 2,0,5,9,4,0,10,0; eight runs, of which 6 are distinct, so that a(11!) = 6.
|
|
|
MATHEMATICA
|
b = 11; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]
|
|
|
CROSSREFS
|
Cf. A043563 (number of runs, not necessarily distinct), A297770.
Sequence in context: A043562 A043537 A047726 * A043563 A043538 A297780
Adjacent sequences: A297776 A297777 A297778 * A297780 A297781 A297782
|
|
|
KEYWORD
|
nonn,base,easy
|
|
|
AUTHOR
|
Clark Kimberling, Feb 03 2018
|
|
|
STATUS
|
approved
|
| |
|
|
