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 A194761 #5 Mar 30 2012 18:57:44 %S A194761 0,0,0,3,2,1,6,4,2,9,6,3,0,10,6,2,14,9,4,18,12,6,22,15,8,1,20,12,4,25, %T A194761 16,7,30,20,10,35,24,13,2,30,18,6,36,23,10,42,28,14,48,33,18,3,40,24, %U A194761 8,47,30,13,54,36,18,61,42,23,4,50,30,10,58,37,16,66,44,22,74 %N A194761 Number of k such that {-k*log(2)} > {-n*log(2)}, where { } = fractional part. %t A194761 r = -Log[2]; p[x_] := FractionalPart[x]; %t A194761 u[n_, k_] := If[p[k*r] <= p[n*r], 1, 0] %t A194761 v[n_, k_] := If[p[k*r] > p[n*r], 1, 0] %t A194761 s[n_] := Sum[u[n, k], {k, 1, n}] %t A194761 t[n_] := Sum[v[n, k], {k, 1, n}] %t A194761 Table[s[n], {n, 1, 100}] (* A194760 *) %t A194761 Table[t[n], {n, 1, 100}] (* A194761 *) %Y A194761 Cf. A194760, A194738. %K A194761 nonn %O A194761 1,4 %A A194761 _Clark Kimberling_, Sep 02 2011