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 A331633 #15 Apr 29 2025 13:31:45 %S A331633 0,2,3,6,5,10,9,14,18,15,24,21,30,17,34,27,44,25,42,35,52,37,54,45,62, %T A331633 33,66,51,84,78,63,96,57,90,75,108,69,102,81,114,93,126,65,130,99,164, %U A331633 85,150,119,184,146,115,180,101,166,135,200,105,170,139,204 %N A331633 Distinct values of A055944 in order of their appearance as n grows. %H A331633 Rémy Sigrist, <a href="/A331633/b331633.txt">Table of n, a(n) for n = 1..10810</a> %H A331633 Rémy Sigrist, <a href="/A331633/a331633.png">Colored scatterplot of the first 97734 terms</a> (where the color is function of the 2-adic valuation of the least k such that a(n) = A055944(k)) %e A331633 A055944 starts: 0, 2, 3, 6, 5, 10, 9, 14, 9, 18, 15, 24, 15, 24, 21, 30, 17, ... %e A331633 We keep: 0, 2, 3, 6, 5, 10, 9, 14, 18, 15, 24, 21, 30, 17, ... %t A331633 DeleteDuplicates[Array[# + IntegerReverse[#, 2] &, 100, 0]] (* _Paolo Xausa_, Apr 28 2025 *) %o A331633 (PARI) s=0; for (n=0, 87, v=n+fromdigits(Vecrev(binary(n)),2); if (!bittest(s, v), print1 (v ", "); s+=2^v)) %Y A331633 Cf. A030101, A055944, A331632. %K A331633 nonn,base %O A331633 1,2 %A A331633 _Rémy Sigrist_, Jan 23 2020