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

%I #10 Mar 11 2014 01:32:31

%S 1,4,6,12,20,24,29,40,50,74,86,99,106,115,143,160,196,210,230,276,298,

%T 342,367,385,400,416,435,456,479,505,543,576,644,674,711,740,805,844,

%U 871,928,978,1066,1111,1196,1243,1326,1374,1408,1457,1508,1587,1640

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

%C For n >= 2, a(n)-a(n-1) = A160855(n).

%Y Cf. A160855.

%K nonn,base

%O 1,2

%A _Leroy Quet_, May 28 2009

%E Extended by _Ray Chandler_, Jun 15 2009

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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)