login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160856 a(1)=1. a(n) = the smallest integer > a(n-1) such that a(n) written in binary contains binary n as a substring, and such that (for n>=2) each value a(k)-a(k-1), for 2<=k<=n, is unique. 1
1, 4, 6, 12, 20, 24, 29, 40, 50, 74, 86, 99, 106, 115, 143, 160, 196, 210, 230, 276, 298, 342, 367, 385, 400, 416, 435, 456, 479, 505, 543, 576, 644, 674, 711, 740, 805, 844, 871, 928, 978, 1066, 1111, 1196, 1243, 1326, 1374, 1408, 1457, 1508, 1587, 1640 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For n >= 2, a(n)-a(n-1) = A160855(n).
LINKS
CROSSREFS
Cf. A160855.
Sequence in context: A045956 A057339 A336552 * A019445 A119638 A178547
KEYWORD
nonn,base
AUTHOR
Leroy Quet, May 28 2009
EXTENSIONS
Extended by Ray Chandler, Jun 15 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 06:24 EST 2024. Contains 370310 sequences. (Running on oeis4.)