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 A226185 #4 Jun 03 2013 00:37:14
%S A226185 1,3,6,10,14,19,26,33,41,50,59,70,82,94,108,122,137,153,170,188,206,
%T A226185 226,246,268,290,313,337,362,388,415,442,471,500,531,562,594,627,661,
%U A226185 695,731,767,805,843,882,922,963,1005,1048,1092,1136,1181,1228,1275
%N A226185 Least positive integer k such that 1 + 1/2 + ... + 1/n < 1 + 1/3 + 1/5 + ... + 1/(2k-1).
%H A226185 Clark Kimberling, <a href="/A226185/b226185.txt">Table of n, a(n) for n = 1..200</a>
%e A226185 a(2) = 3 because 1 + 1/3 < 1 + 1/2 < 1 + 1/3 + 1/5.
%t A226185 z = 54; f[n_] := 1/n; p[n_] := p[n] = Sum[f[k], {k, 1, n}]; q[n_] := 1/(2 n - 1); Do[s = 0; a[n] = NestWhile[# + 1 &, 1, ! (s += q[#]) >= p[n] &], {n, 1, z}]; m = Map[a, Range[z]]
%Y A226185 Cf. A226183.
%K A226185 nonn
%O A226185 1,2
%A A226185 _Clark Kimberling_, May 30 2013