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 A330340 #29 Jan 22 2020 12:56:26 %S A330340 0,1,2,4,3,6,5,7,10,16,9,14,11,20,18,15,32,17,22,26,21,19,30,34,23,27, %T A330340 44,31,38,64,33,50,46,37,54,35,68,45,62,39,66,76,51,84,47,55,74,70,92, %U A330340 63,128,65,98,78,86,73,106,69,102,94,67,132,77,110,85,118 %N A330340 a(n) is the least k such that A092213(n) = k + reverse(k) (where reverse(k) is the binary reverse of k, A030101(k)). %H A330340 Rémy Sigrist, <a href="/A330340/b330340.txt">Table of n, a(n) for n = 0..7528</a> %H A330340 Rémy Sigrist, <a href="/A330340/a330340.gp.txt">PARI program for A330340</a> %F A330340 a(n) + A030101(a(n)) = A092213(n). %F A330340 a(n) <= A331585(n). %e A330340 For n = 3: %e A330340 - A092213(3) = 5, %e A330340 - 4 is the least k such that k + reverse(k) = 5, %e A330340 - so a(3) = 4. %o A330340 (PARI) See Links section. %Y A330340 Cf. A030101, A055944, A092213, A331585. %K A330340 nonn,base %O A330340 0,3 %A A330340 _Rémy Sigrist_, Jan 21 2020