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 A226763 #14 Nov 03 2024 02:24:25
%S A226763 1,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,7,7,7,7,7,8,8,8,8,8,9,9,
%T A226763 9,9,9,9,10,10,10,10,10,11,11,11,11,11,11,12,12,12,12,12,12,13,13,13,
%U A226763 13,13,13,14,14,14,14,14,14,15,15,15,15,15,15,16
%N A226763 Least k such that 1/k <= mean of {1, 1/2, 1/3, ..., 1/n}.
%H A226763 Clark Kimberling, <a href="/A226763/b226763.txt">Table of n, a(n) for n = 1..1000</a>
%F A226763 a(n) = ceiling(n/(Sum_{k=1..n} 1/k)).
%e A226763 1/4 < mean{1,1/2,1/3,...,1/9} < 1/3, so that a(9) = 4.
%t A226763 f[n_] := Mean[Table[1/k, {k, 1, n}]]
%t A226763 Table[Floor[1/f[n]], {n, 1, 120}] (* A226762 *)
%t A226763 Table[Ceiling[1/f[n]], {n, 1, 120}] (* this sequence *)
%Y A226763 Cf. A226762.
%K A226763 nonn,easy
%O A226763 1,2
%A A226763 _Clark Kimberling_, Jun 19 2013
%E A226763 Name corrected by _Jason Yuen_, Nov 02 2024