A043564 -id:A043564 - cp's OEIS frontend

A297770 Number of distinct runs in base-2 digits of n.

1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 2, 1, 2, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 1, 2, 2, 3, 3, 2, 3, 4, 3, 3, 3, 2, 3, 4, 3, 3, 3, 2, 3, 4, 2, 4, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 1, 2, 2, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 4, 4, 3, 3, 3, 3, 4, 3, 2, 3

Offset: 1

Clark Kimberling, Jan 26 2018

Every positive integers occurs infinitely many times.
***
Guide to related sequences:
Base b      # runs    # distinct runs
      A005811       A297770
      A043555       A297771
      A043556       A297772
      A043557       A297773
      A043558       A297774
      A043559       A297775
      A043560       A297776
      A043561       A297777
      A043562       A297778
      A043563       A297779
      A043564       A297780
      A043565       A297781
      A043566       A297782
      A043567       A297783
      A043568       A297784

			27 in base-2: 1,1,0,1,1; three runs, of which 2 are distinct:  0 and 11, so that a(27) = 2.

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A005811 (number of runs, not necessarily distinct).

b = 2; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]

apply( {A297770(n)=my(r=[0,0], c); while(n, my(d=bitand(n,1), L=valuation(n+d, 2)); !bittest(r[1+d], L) && c++ && r[1+d] += 1<>=L); c}, [0..99]) \\ M. F. Hasler, Jul 13 2024

a(n) = my(s=strjoin(binary(n)), v=vecsort(concat(strsplit(s, "1"), strsplit(s, "0")), , 8)); #v-(v[1]==""); \\ Ruud H.G. van Tol, Aug 05 2024

from itertools import groupby
def A297770(n): return len(set(map(lambda x:tuple(x[1]),groupby(bin(n)[2:])))) # Chai Wah Wu, Jul 13 2024

A297780 Number of distinct runs in base-12 digits of n.

Original entry on oeis.org

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, 1, 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, 1, 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, 1, 2, 2, 2, 2, 2, 2, 2, 2

Offset: 1

Clark Kimberling, Feb 03 2018

Every positive integers occurs infinitely many times. See A297770 for a guide to related sequences.

			3006865 in base-12: 1,0,1,0,1,0,1; seven runs, of which 2 are distinct, so that a(3006865) = 2.

Clark Kimberling, Table of n, a(n) for n = 1..10000

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

b = 12; s[n_] := Length[Union[Split[IntegerDigits[n, b]]]]
Table[s[n], {n, 1, 200}]

cp's OEIS Frontend

A297770 Number of distinct runs in base-2 digits of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI