This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238757 Lexicographically earliest sequence of distinct positive integers such that for any n>0 we have (a(n) AND n) = 0 (where AND stands for the bitwise AND operator). 3
 2, 1, 4, 3, 8, 9, 16, 5, 6, 17, 20, 18, 32, 33, 48, 7, 10, 12, 36, 11, 34, 40, 64, 35, 38, 37, 68, 65, 66, 96, 128, 13, 14, 21, 24, 19, 26, 25, 72, 22, 70, 69, 80, 67, 82, 81, 144, 15, 74, 73, 76, 75, 130, 129, 136, 71, 132, 133, 192, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is a permutation of the positive integers. Apparently, a self inverse permutation. There are no fixed points. LINKS Paul Tek, Table of n, a(n) for n = 1..10000 Paul Tek, Perl program for this sequence PROG (Perl) See Link section. CROSSREFS Cf. A238758. Sequence in context: A028297 A207537 A114438 * A306888 A262230 A262155 Adjacent sequences:  A238754 A238755 A238756 * A238758 A238759 A238760 KEYWORD nonn AUTHOR Paul Tek, Mar 05 2014 STATUS approved

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

Last modified October 20 22:37 EDT 2019. Contains 328291 sequences. (Running on oeis4.)