A112380 A self-descriptive fractal sequence: if 1 is subtracted from every term and any zero terms are omitted, the original sequence is recovered (this process may be called "lower trimming").

1, 2, 1, 1, 3, 2, 1, 2, 1, 4, 1, 1, 1, 3, 2, 3, 1, 1, 2, 5, 1, 2, 1, 1, 2, 2, 1, 4, 1, 1, 1, 1, 3, 4, 2, 2, 1, 3, 1, 6, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 3, 3, 1, 1, 1, 2, 5, 2, 1, 2, 1, 2, 1, 1, 2, 4, 1, 1, 1, 1, 1, 5, 3, 3, 2, 4, 1, 2, 1, 1, 7, 2, 1, 3, 1, 2, 1, 1, 2, 2, 1, 1, 4, 3, 1, 3, 1, 1, 1

Offset

0,2

Comments

Each element also gives the number of zeros dropped before it and the number of elements written before the next zero.

Links

Table of n, a(n) for n=0..98.

Crossrefs

Cf. A112377, A112379.

Sequence in context: A192710 A316831 A355737 * A272121 A273135 A165162

Adjacent sequences: A112377 A112378 A112379 * A112381 A112382 A112383

Keyword

nonn,easy

Author

Kerry Mitchell, Dec 04 2005

Status

approved