cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A297781 Number of distinct runs in base-13 digits of n.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, Feb 03 2018

Keywords

Comments

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

Examples

			5200468 in base-13: 1,1,0,1,1,0,0; four runs, of which 3 are distinct, so that a(5200468) = 3.
		

Crossrefs

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

Programs

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