login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3

%I

%S 1,3,10,11,12,21,110,111,112,113,114,115,116,117,118,119,120,121,122,

%T 123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,

%U 140,141,142,1111,11111,111111,1111111,11111111,11111112,11111113

%N 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.

%C There can be 1's in other positions too.

%C 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

%H <a href="/index/Se#self-referencing_sequences">Index to the OEIS: Entries related to self-referencing sequences</a>.

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

%Y Cf. A098670. See A098645 for another version.

%Y Cf. A210414-A210423.

%K base,easy,nonn

%O 1,2

%A _Eric Angelini_, Oct 27 2004

%E Entry revised by Eric Angelini and _N. J. A. Sloane_, Feb 03 2006.

%E More terms from _Rick L. Shepherd_, Feb 05 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 17:46 EDT 2019. Contains 327273 sequences. (Running on oeis4.)