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 A224072 #29 Feb 20 2021 07:55:23 %S A224072 21,69,81,87,93,117,171,213,261,273,279,285,309,321,327,333,339,345, %T A224072 351,357,369,375,381,405,453,465,471,477,501,555,597,651,675,681,687, %U A224072 699,747,789,837,849,855,861,885,939,981,1029,1041,1047,1053,1077,1089,1095 %N A224072 Odd odious numbers divisible by 3. %C A224072 By Moser-Newman phenomenon among the first N positive integers multiple of 3, the evil numbers are always in the majority. Moreover, this excess tends to infinity as N goes to infinity and its growth is of order N^a, where a = log(3)/log(4). %H A224072 Peter J. C. Moses, <a href="/A224072/b224072.txt">Table of n, a(n) for n = 1..10000</a> %H A224072 J. Coquet, <a href="http://gdz.sub.uni-goettingen.de/dms/resolveppn/?PPN=GDZPPN002099551">A summation formula related to the binary digits</a>, Inventiones Mathematicae 73 (1983), pp. 107-115. %H A224072 D. J. Newman, <a href="http://dx.doi.org/10.1090/S0002-9939-1969-0244149-8">On the number of binary digits in a multiple of three</a>, Proc. Amer. Math. Soc. 21 (1969) 719-721. %H A224072 Vladimir Shevelev, <a href="http://www.hindawi.com/journals/ijmms/2008/908045.html">Generalized Newman phenomena and digit conjectures on primes</a>, Internat. J. of Mathematics and Math. Sciences, 2008 (2008), Article ID 908045, 1-12. %t A224072 Select[Range[3, 2000, 6], OddQ[DigitCount[#, 2]][[1]] &] (* _Peter J. C. Moses_, Apr 04 2013 *) %o A224072 (PARI) isok(m) = (m % 2) && !(m % 3) && (hammingweight(m) % 2); \\ _Michel Marcus_, Feb 20 2021 %Y A224072 Cf. A000069, A001969, A223024, A180963. %K A224072 nonn,base %O A224072 1,1 %A A224072 _Vladimir Shevelev_, Mar 30 2013