This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083653 Consider the binary Champernowne sequence (A030190): smallest number m such that in binary representation n is contained in the concatenation of m and its successors. 2
 0, 1, 2, 1, 4, 2, 1, 3, 8, 4, 10, 2, 3, 1, 3, 7, 16, 8, 4, 9, 18, 10, 21, 2, 7, 3, 9, 1, 3, 5, 7, 15, 32, 16, 8, 17, 36, 4, 9, 19, 34, 18, 10, 10, 37, 21, 2, 6, 15, 7, 3, 12, 19, 9, 21, 1, 7, 3, 19, 5, 7, 13, 15, 31, 64, 32, 16, 33, 8, 34, 17, 35, 68, 36, 18, 4, 73, 9, 19, 39, 66, 34, 20, 18 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n)<=n; see A083655 for numbers m with a(m)=m; a(A055143(n))=1; A083654(n)-1 = number of successors of a(n) to cover n. LINKS EXAMPLE n=24: '11000'=24 is a suffix of the concatenation of the first 8 numbers: '0'1'10'11'100'101'110'111'1000', therefore a(24)=7 and A083654(24)=2. CROSSREFS Cf. A030304, A007088. Sequence in context: A286321 A118235 A304624 * A278290 A135152 A329504 Adjacent sequences:  A083650 A083651 A083652 * A083654 A083655 A083656 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, May 01 2003 EXTENSIONS Edited by Charles R Greathouse IV, Apr 26 2010 STATUS approved

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.

Last modified December 15 22:02 EST 2019. Contains 330012 sequences. (Running on oeis4.)