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.

A303577 Break up the list of values of the divisor function d(k) into nondecreasing runs; sequence gives lengths of successive runs.

Original entry on oeis.org

4, 2, 2, 2, 2, 4, 2, 2, 2, 2, 4, 2, 2, 4, 4, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 4, 2, 2, 1, 1, 2, 4, 2, 2, 4, 4, 2, 3, 1, 2, 2, 2, 2, 3, 3, 4, 2, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 2, 4, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 2, 1, 1, 2, 4, 2, 2, 2, 2, 6
Offset: 1

Views

Author

N. J. A. Sloane, Apr 29 2018

Keywords

Examples

			The initial values of d(k) = A000005(k) for k = 1,2,3,... are
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, 6, 4, 4, 2, 8, 3, 4, 4, 6, 2, 8, 2, 6, 4, 4, 4, 9, 2, 4, 4, 8, 2, 8, 2, 6, 6, 4, 2, 10, 3, 6, 4, 6, 2, 8, 4, 8, 4, 4, 2, 12, 2, 4, 6, 7, 4, 8, 2, 6, 4, 8, 2, 12, 2, 4, 6, 6, 4, 8, 2, ...
Breaking this up into nondecreasing runs we get:
[1, 2, 2, 3], [2, 4], [2, 4], [3, 4], [2, 6], [2, 4, 4, 5], [2, 6], [2, 6], [4, 4], [2, 8], [3, 4, 4, 6], [2, 8], [2, 6], [4, 4, 4, 9], [2, 4, 4, 8], [2, 8], [2, 6, 6], [4], [2, 10], [3, 6], [4, 6], [2, 8], [4, 8], [4, 4], [2, 12], [2, 4, 6, 7], ...
whose successive lengths are
4,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,3,1,2,...
		

Crossrefs

Cf. A000005.
A303578(m) gives value of n that starts the m-th run.
A284597(m) is the smallest number that starts a run of length m.

Extensions

More terms from Seiichi Manyama, Apr 29 2018