cp's OEIS Frontend

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.

A226189 Least positive integer k such that 1 + 1/2 + ... + 1/k >= sqrt(n).

This page as a plain text file.
%I A226189 #7 Aug 06 2019 14:25:17
%S A226189 1,2,3,4,5,6,8,9,11,13,15,18,21,24,27,31,35,39,44,49,55,61,68,75,83,
%T A226189 92,101,112,122,134,147,161,175,191,208,227,246,267,289,313,339,366,
%U A226189 396,427,460,495,533,573,616,661,709,760,815,872,934,998,1067,1140
%N A226189 Least positive integer k such that 1 + 1/2 + ... + 1/k >= sqrt(n).
%H A226189 Clark Kimberling, <a href="/A226189/b226189.txt">Table of n, a(n) for n = 1..150</a>
%e A226189 a(12) = 18 because 1 + 1/2 + ... + 1/17 < sqrt(12) < 1 + 1/2 + ... + 1/18.
%t A226189 z = 80; f[n_] := 1/n; Do[s = 0; a[n] = NestWhile[# + 1 &, 1, ! (s += f[#]) >= Sqrt[n] &], {n, 1, z}]; m = Map[a, Range[z]]
%t A226189 Table[Ceiling[x /. FindInstance[HarmonicNumber[x] == Sqrt[n] && x > 0, x][[1]]], {n, 80}] (* _Vladimir Reshetnikov_, Aug 06 2019 *)
%Y A226189 Cf. A226183, A226190.
%K A226189 nonn
%O A226189 1,2
%A A226189 _Clark Kimberling_, May 30 2013