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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165415 a(n) = the smallest positive integer that contains more digits written in binary than n has written in binary, and which does not contain binary n as a substring in its binary representation. 0
7, 4, 10, 8, 8, 8, 18, 16, 16, 16, 16, 16, 16, 16, 34, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 66, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 130, 128, 128, 128, 128, 128, 128 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

FORMULA

a(2) = 7. For n >=2: a(2^n) = 2^(n+1) + 2; for m such that 2^(n-1)+1 <= m <= 2^n-1, a(m) = 2^n.

CROSSREFS

Sequence in context: A155823 A195452 A103227 * A069199 A138339 A107827

Adjacent sequences:  A165412 A165413 A165414 * A165416 A165417 A165418

KEYWORD

base,easy,nonn

AUTHOR

Leroy Quet, Sep 17 2009

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 13 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.