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 A091785 #28 Jan 21 2020 21:04:10
%S A091785 3,5,9,12,15,17,20,23,27,29,33,36,39,43,45,48,51,53,57,60,63,65,68,71,
%T A091785 75,77,80,83,85,89,92,95,99,101,105,108,111,113,116,119,123,125,129,
%U A091785 132,135,139,141,144,147,149,153,156,159,163,165,169,172,175,177,180,183
%N A091785 Evil numbers (see A001969) in A003159.
%C A091785 Also n such that A033485(n) == 3 (mod 4); see A007413.
%C A091785 Also n such that A029883(n-1) = -1, A036577(n-1) = 0, A036585(n-1) = 1. - _Philippe Deléham_, Mar 25 2004
%C A091785 The number of odd numbers before the n-th even number in this sequence is a(n). - _Philippe Deléham_, Mar 27 2004
%C A091785 Numbers n such that {A010060(n-1), A010060(n)}={1,0} where A010060 is the Thue-Morse sequence. - _Benoit Cloitre_, Jun 16 2006
%H A091785 G. C. Greubel, <a href="/A091785/b091785.txt">Table of n, a(n) for n = 1..10000</a>
%H A091785 Aviezri S. Fraenkel, <a href="http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/DISC8773.pdf">The vile, dopey, evil and odious game players</a>, Discrete Math. 312 (2012), pp. 42-46.
%H A091785 <a href="/index/Ar#2-automatic">Index entries for 2-automatic sequences</a>.
%F A091785 a(n) = A003159(2*n) = A036554(2*n)/2.
%F A091785 a(n) is asymptotic to 3*n. - _Benoit Cloitre_, Mar 22 2004
%F A091785 A050292(a(n)) = 2n. - _Philippe Deléham_, Mar 26 2004
%t A091785 A036554 := Select[Range[750], OddQ[IntegerExponent[#, 2]] &]; Table[ A036554[[2*n]]/2, {n, 1, 50}] (* _G. C. Greubel_, Jan 14 2018 *)
%o A091785 (PARI) is(n)=hammingweight(n-1)%2 && hammingweight(n)%2==0 \\ _Charles R Greathouse IV_, Mar 26 2013
%K A091785 easy,nonn
%O A091785 1,1
%A A091785 _Philippe Deléham_, Mar 16 2004
%E A091785 More terms from _Benoit Cloitre_, Mar 22 2004