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 A095902 #7 Mar 21 2017 13:35:03
%S A095902 1,2,2,3,6,12,27,55,115,235,490,994,2008,4036,8120,16280,32640,65344,
%T A095902 130879,261935,524057,1048301,2096855,4193951,8388239,16776799,
%U A095902 33554339,67109539,134220995
%N A095902 Number of odd entries in A004001 that are <= 2^n.
%C A095902 Even entries and odd entries are equal only when n=4, 6 and 12. Past that, the evens outnumber the odds.
%F A095902 a(n) = A283480(2^n) - _Antti Karttunen_, Mar 21 2017
%t A095902 a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; c = 0; k = 1; Do[ While[k <= 2^n, If[ Mod[ a[k], 2] == 1, c++ ]; k++ ]; Print[c], {n, 21}]
%o A095902 (Scheme) (define (A095902 n) (A283480 (A000079 n))) ;; _Antti Karttunen_, Mar 21 2017
%Y A095902 Cf. A000079, A004001, A095901, A283480.
%K A095902 more,nonn
%O A095902 0,2
%A A095902 _Robert G. Wilson v_, Jun 12 2004
%E A095902 a(22)-a(28) from _Donovan Johnson_, Jan 28 2009