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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175335 a(1)=1. For n>1, a(n) equals the smallest number > a(n-1) of the form a(k) U j U a(k) U j, where U represents concatenation (written in decimal) of the binary representation of the arguments, where 1 <= k < n, and j = {0} or {1}. 1

%I #9 Mar 11 2014 01:32:52

%S 1,10,15,660,693,990,1023,2704680,2706729,2839914,2841963,4057020,

%T 4059069,4192254,4194303,45377005980240,45377014368849,45411382499922,

%U 45411390888531,47645856279252,47645864667861,47680232798934,47680241187543

%N a(1)=1. For n>1, a(n) equals the smallest number > a(n-1) of the form a(k) U j U a(k) U j, where U represents concatenation (written in decimal) of the binary representation of the arguments, where 1 <= k < n, and j = {0} or {1}.

%C Each term of this sequence exists in sequence A175336.

%e 10 (decimal), a term of the sequence, written in binary is 1010. Letting j={0}, we have that the decimal value of 1010 U 0 U 1010 U 0 = 1010010100, which is 660, is in the sequence.

%Y Cf. A175336

%K base,nonn

%O 1,2

%A _Leroy Quet_, Apr 14 2010

%E More terms from _Max Alekseyev_, Jun 13 2011

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.

Last modified December 6 20:29 EST 2023. Contains 367616 sequences. (Running on oeis4.)