This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A370429 #11 Feb 21 2024 01:33:17 %S A370429 0,1,3,2,5,4,7,6,9,8,13,12,11,10,15,14,17,16,25,24,21,20,27,26,19,18, %T A370429 23,22,31,30,29,28,33,32,49,48,41,40,57,56,37,36,53,52,45,44,51,50,35, %U A370429 34,47,46,43,42,59,58,39,38,55,54,63,62,61,60,65,64,97,96 %N A370429 Lexicographically earliest sequence of distinct nonnegative integers such that for any n >= 0, n OR a(n) is a binary palindrome (where OR denotes the bitwise OR operator). %C A370429 This sequence is a self-inverse permutation of the nonnegative integers. %H A370429 Rémy Sigrist, <a href="/A370429/b370429.txt">Table of n, a(n) for n = 0..8192</a> %H A370429 Rémy Sigrist, <a href="/A370429/a370429.png">Scatterplot of the first 2^18 terms</a> %H A370429 Rémy Sigrist, <a href="/A370429/a370429.gp.txt">PARI program</a> %H A370429 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A370429 a(n) >= A370427(n). %e A370429 The first terms, alongside the corresponding binary expansions, are: %e A370429 n a(n) bin(n) bin(a(n)) bin(n OR a(n)) %e A370429 -- ---- ------ --------- -------------- %e A370429 0 0 0 0 0 %e A370429 1 1 1 1 1 %e A370429 2 3 10 11 11 %e A370429 3 2 11 10 11 %e A370429 4 5 100 101 101 %e A370429 5 4 101 100 101 %e A370429 6 7 110 111 111 %e A370429 7 6 111 110 111 %e A370429 8 9 1000 1001 1001 %e A370429 9 8 1001 1000 1001 %e A370429 10 13 1010 1101 1111 %e A370429 11 12 1011 1100 1111 %e A370429 12 11 1100 1011 1111 %e A370429 13 10 1101 1010 1111 %e A370429 14 15 1110 1111 1111 %e A370429 15 14 1111 1110 1111 %o A370429 (PARI) See Links section. %Y A370429 Cf. A006995, A370427. %K A370429 nonn,base %O A370429 0,3 %A A370429 _Rémy Sigrist_, Feb 18 2024