A112379 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, 3, 2, 1, 4, 1, 3, 2, 5, 1, 2, 4, 1, 3, 1, 6, 2, 3, 5, 1, 2, 1, 4, 2, 7, 1, 3, 4, 1, 6, 2, 3, 2, 5, 1, 3, 1, 8, 2, 1, 4, 5, 2, 7, 1, 3, 1, 4, 3, 6, 1, 2, 1, 4, 2, 9, 3, 2, 5, 1, 6, 3, 1, 8, 2, 4, 1, 2, 5, 4, 7, 2, 1, 3, 1, 2, 5, 1, 3, 1, 10, 4, 3, 6, 1, 2, 7, 1, 4, 2, 9, 3, 5, 2, 3, 1, 6

Offset

0,2

Comments

The sequence also gives the number of numbers that are retained between zeros that are dropped. Alternatively, each element is the number of numbers between 1's in the original sequence.

Links

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

Crossrefs

Cf. A112377, A112380.

Sequence in context: A348888 A128260 A083368 * A361101 A308780 A246700

Adjacent sequences: A112376 A112377 A112378 * A112380 A112381 A112382

Keyword

nonn,easy

Author

Kerry Mitchell, Dec 04 2005

Status

approved