A039617 Solution to a "self-describing sequence" puzzle of Raphael Robinson.

1, 0, 11, 1, 2, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9

Offset

0,3

Links

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

J. Sauerberg and L. Shu, The long and the short on counting sequences, Amer. Math. Monthly, 104 (1997), 306-317.

Example

From Eric Angelini, Mar 03 2020: (Start)
This finite sequence must be read like this:
there is 1 digit 0 in the sequence;
there are 11 digits 1 in the sequence;
there are 2 digits 2 in the sequence;
there is 1 digit 3 in the sequence; etc.
(End)

Crossrefs

Cf. A039616.

Sequence in context: A159861 A010197 A010196 * A229186 A214676 A010198

Adjacent sequences: A039614 A039615 A039616 * A039618 A039619 A039620

Keyword

nonn,fini,full

Author

N. J. A. Sloane

Status

approved