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 A031444 #18 Aug 03 2023 03:43:54 %S A031444 4,17,18,20,24,67,69,70,73,74,76,81,82,84,88,97,98,100,104,112,263, %T A031444 267,269,270,275,277,278,281,282,284,291,293,294,297,298,300,305,306, %U A031444 308,312,323,325,326,329,330,332,337,338,340,344 %N A031444 Numbers whose base-2 representation has one more 0 than 1's. %C A031444 If m is a term, then also 4*m+1. - _Reinhard Zumkeller_, Mar 31 2015 %H A031444 Reinhard Zumkeller, <a href="/A031444/b031444.txt">Table of n, a(n) for n = 1..10000</a> %H A031444 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>. %F A031444 A037861(a(n)) = 1. - _Reinhard Zumkeller_, Mar 31 2015 %t A031444 Select[Range[350], (Differences@ DigitCount[#, 2])[[1]] == 1 &] (* _Amiram Eldar_, Aug 03 2023 *) %o A031444 (Haskell) %o A031444 a031444 n = a031444_list !! (n-1) %o A031444 a031444_list = filter ((== 1) . a037861) [1..] %o A031444 -- _Reinhard Zumkeller_, Mar 31 2015 %Y A031444 Cf. A007088, A023416, A000120, A031448, A037861, A095072 (subsequence). %Y A031444 Subsequence of A089648. %K A031444 nonn,base %O A031444 1,1 %A A031444 _Clark Kimberling_