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.

A085693 Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, = f(4) = 44445, f(5) = 555556, etc. Sequence gives concatenation of 0, f(0), f(f(0)), f(f(f(0))), ...

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 5, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3
Offset: 0

Views

Author

Philippe Deléham, Aug 14 2003; revised Sep 18 2005

Keywords

Examples

			0;
1;
1, 2;
1, 2, 2, 2, 3;
1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4; ...
For large m, the m-th block is given by A085694.
		

Crossrefs

Cf. A085694, A000110, A048993 (the number of occurrences of k in n-th block).
Row maxima of A120698.

Extensions

Edited by Charles R Greathouse IV, Apr 30 2010