|
%I #9 Mar 11 2014 01:32:34
%S 1,2,3,4,5,6,7,8,9,10,13,14,22,23,30,31,34,36,50,52,53,54,58,59,76,86,
%T 91,92,93,94,95,96,97,98,99,100,105,114,115,116,148,149,181,182,183,
%U 186,189,190,198,204,205,214,215,216,236,237,295,302,311,316,350,351,382
%N a(1)=1. a(n) = the smallest integer > a(n-1) containing {the string made by reversing the order of the binary digits of n, and removing leading 0's} as a substring when a(n) is written in binary.
%H Jasper Mulder, <a href="/A161979/b161979.txt">Table of n, a(n) for n=1..2000</a>
%e 13 in binary is 1101, which reversed is 1011. a(13) = the smallest integer > a(12)=14 that contains the string 1011 as a substring in its binary representation. a(13) therefore equals 22, which is 10110 in binary.
%Y Cf. A030101, A161980.
%K base,nonn
%O 1,2
%A _Leroy Quet_, Jun 23 2009
%E Corrected and extended by _Sean A. Irvine_ and Jasper Mulder (jasper.mulder(AT)planet.nl), Oct 04 2009
%E Minor edits by _Ray Chandler_, Mar 12 2010
|
