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 A331632 #18 Apr 29 2025 13:31:34 %S A331632 0,1,3,7,5,-2,9,2,15,-6,21,6,31,17,-14,27,-4,13,-18,35,4,-10,45,14,41, %T A331632 10,49,18,63,33,-30,51,-12,-42,75,12,93,30,81,105,42,127,65,-62,99, %U A331632 -28,37,-90,119,-8,57,-70,91,-36,29,-98,135,8,73,-54,107,-20,-82 %N A331632 Distinct values of A055945 in order of their appearance as n grows. %H A331632 Rémy Sigrist, <a href="/A331632/b331632.txt">Table of n, a(n) for n = 1..8032</a> %H A331632 Rémy Sigrist, <a href="/A331632/a331632.png">Colored scatterplot of the first 74383 terms</a> (where the color is function of the 2-adic valuation of the least k such that a(n) = A055945(k)) %e A331632 A055945 starts: 0, 0, 1, 0, 3, 0, 3, 0, 7, 0, 5, -2, 9, 2, 7, 0, 15, 0, ... %e A331632 We keep: 0, 1, 3, 7, 5, -2, 9, 2, 15, ... %t A331632 DeleteDuplicates[Array[# - IntegerReverse[#, 2] &, 200]] (* _Paolo Xausa_, Apr 28 2025 *) %o A331632 (PARI) s=[]; for (n=0, 151, v=n-fromdigits(Vecrev(binary(n)),2); if (!setsearch(s,v), print1 (v ", "); s=setunion(s, [v]))) %Y A331632 Cf. A030101, A055945, A331633. %K A331632 sign,base,look %O A331632 1,3 %A A331632 _Rémy Sigrist_, Jan 23 2020