A114134 Start with a(1) = 1. For n>1, choose a(n) to be the smallest number > a(n-1) consistent with the condition that "the a(n)-th digit is a 1" is true for all n.

1, 3, 10, 11, 12, 21, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 1111, 11111, 111111, 1111111, 11111111, 11111112, 11111113

Offset: 1

Author

Eric Angelini, Oct 27 2004

Keywords

• base
• easy
• nonn

Comments

There can be 1's in other positions too.

Sequence A098645 does not allow 1's in other positions, A210415 is a variant which does not impose a(n)>a(n-1). - M. F. Hasler, Oct 08 2013

Examples

			The first digit of the sequence is a "1", the 3rd digit also, then the 10th, the 11th, etc.
		

Links

• Index to the OEIS: Entries related to self-referencing sequences.

Crossrefs

Cf. A098670. See A098645 for another version.

Cf. A210414-A210423.

Extensions

Entry revised by Eric Angelini and N. J. A. Sloane, Feb 03 2006.

More terms from Rick L. Shepherd, Feb 05 2006