A161979 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.

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, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 105, 114, 115, 116, 148, 149, 181, 182, 183, 186, 189, 190, 198, 204, 205, 214, 215, 216, 236, 237, 295, 302, 311, 316, 350, 351, 382

Offset

1,2

Links

Jasper Mulder, Table of n, a(n) for n=1..2000

Example

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.

Crossrefs

Cf. A030101, A161980.

Sequence in context: A287513 A194403 A305707 * A247810 A247800 A092968

Adjacent sequences: A161976 A161977 A161978 * A161980 A161981 A161982

Keyword

base,nonn

Author

Leroy Quet, Jun 23 2009

Extensions

Corrected and extended by Sean A. Irvine and Jasper Mulder (jasper.mulder(AT)planet.nl), Oct 04 2009

Minor edits by Ray Chandler, Mar 12 2010

Status

approved