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 A161602 #29 Jan 20 2023 01:35:07 %S A161602 2,4,6,8,10,12,13,14,16,18,20,22,24,25,26,28,29,30,32,34,36,38,40,41, %T A161602 42,44,46,48,49,50,52,53,54,56,57,58,59,60,61,62,64,66,68,70,72,74,76, %U A161602 78,80,81,82,84,86,88,89,90,92,94,96,97,98,100,101,102,104,105,106,108,109 %N A161602 Positive integers k that are greater than the value of the reversal of k's binary representation. %C A161602 By "reversal" of k's binary representation, it is meant: write k in binary, reverse the order of its digits, and read the result as a binary value. %C A161602 This sequence contains all the positive even integers. %H A161602 Jonathan Frech, <a href="/A161602/b161602.txt">Table of n, a(n) for n = 1..10000</a> %e A161602 29 in binary is 11101. Its digital reversal is 10111, which is 23 in decimal. Since 29 > 23, 29 is in this sequence. %t A161602 Select[Range[109], # > IntegerReverse[#, 2] &] (* _Michael De Vlieger_, Apr 07 2021 *) %o A161602 (PARI) isok(k) = k > fromdigits(Vecrev(binary(k)), 2); \\ _Michel Marcus_, Apr 06 2021 %o A161602 (Python) %o A161602 from itertools import count, islice %o A161602 def A161602_gen(startvalue=1): # generator of terms >= startvalue %o A161602 return filter(lambda n:n>int(bin(n)[-1:1:-1],2),count(max(startvalue,1))) %o A161602 A161602_list = list(islice(A161602_gen(),20)) # _Chai Wah Wu_, Jan 19 2023 %Y A161602 Cf. A030101, A006995, A161601, A161603 (odd terms). %Y A161602 Cf. A071590 (using decimal reversal). %K A161602 base,nonn %O A161602 1,1 %A A161602 _Leroy Quet_, Jun 14 2009 %E A161602 More terms from _Max Alekseyev_, Sep 11 2009