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 A114699 #4 Oct 31 2013 12:17:36
%S A114699 0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,3,0,0,6,0,0,10,1,0,18,0,0,36,0,0,
%T A114699 62,0,4,113,0,0,210,6,0,391,0,0,739,0,0,1365,2,20,2570,0,0,4854,37,4,
%U A114699 9198,0,0,17544,0,0,33296,0,126,63550,0,0,121574,248,0,233016,0,0,447828,0
%N A114699 A000799(n) - A064355(n).
%C A114699 There was a suggestion that these were the same sequence, but they are not.
%F A114699 A000799(n) = A064355(n) just for: (1) n a power of 2. (2) n = p * 2^k, where p is a prime with p > 2^{2^k - k}. (Including the case k=0. ) (3) n = 9. -Franklin T. Adams-Watters, Feb 14 2006
%t A114699 f[n_] := Block[{d = Select[Divisors@n, OddQ@# &]}, Floor[2^n/n] - Plus @@ (2^(n/d)*MoebiusMu@d)/n]; Array[f, 76] (* _Robert G. Wilson v_ *)
%Y A114699 Cf. A000799, A064355.
%K A114699 nonn
%O A114699 0,15
%A A114699 Paul D. Hanna, Feb 20 2006
%E A114699 More terms from _Robert G. Wilson v_, Feb 20 2006