

A002387


Least k such that H(k) > n, where H(k) is the harmonic number sum_{i=1..k} 1/i.
(Formerly M1249 N1385)


61



1, 2, 4, 11, 31, 83, 227, 616, 1674, 4550, 12367, 33617, 91380, 248397, 675214, 1835421, 4989191, 13562027, 36865412, 100210581, 272400600, 740461601, 2012783315, 5471312310, 14872568831, 40427833596, 109894245429, 298723530401, 812014744422
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

For k>=1, log(k+1/2) + gamma < H(k) < log(k+1/2) + gamma + 1/(24k^2), where gamma is Euler's constant (A001620). It is likely that the upper and lower bounds have the same floor for all k>=2, in which case a(n) = floor(exp(ngamma)+1/2) for all n>=0.  Dean Hickerson, Apr 19 2003
This remark is based on a simple heuristic argument. The lower and upper bounds differ by 1/(24k^2), so the probability that there's an integer between the two bounds is 1/(24k^2). Summing that over all k >= 2 gives the expected number of values of k for which there's an integer between the bounds. That sum equals Pi^2/144  1/24 ~ 0.02687. That's much less than 1, so it is unlikely that there are any such values of k.  Dean Hickerson, Apr 19 2003
Referring to A118050 and A118051, using a few terms of the asymptotic series for the inverse of H(x), we can get an expression which, with greater likelihood than mentioned above, should give a(n) for all n >= 0. For example, using the same type of heuristic argument given by Dean Hickerson, it can be shown that, with probability > 99.995%, we should have, for all n >= 0, a(n) = floor(u + 1/2  1/(24u) + 3/(640u^3)) where u = e^(n  gamma).  David W. Cantrell (DWCantrell(AT)sigmaxi.net)
For k > 1, H(k) is never an integer. Hence apart from the first two terms this sequence coincides with A004080.  Nick Hobson, Nov 25 2006


REFERENCES

John H. Conway and R. K. Guy, "The Book of Numbers," Copernicus, an imprint of SpringerVerlag, NY, 1996, page 258259.
J.M. De Koninck, Ces nombres qui nous fascinent, Entry 83, p. 28, Ellipses, Paris 2008.
Ronald Lewis Graham, Donald Ervin Knuth and Oren Patashnik, "Concrete Mathematics, a Foundation for Computer Science," AddisonWesley Publishing Co., Reading, MA, 1989, Page 258264, 438.
W. Sierpiński, Sur les decompositions de nombres rationnels, Oeuvres Choisies, Académie Polonaise des Sciences, Warsaw, Poland, 1974, p. 181.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane, Illustration for sequence M4299 (=A007340) in The Encyclopedia of Integer Sequences (with Simon Plouffe), Academic Press, 1995.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
I. Stewart, L'univers des nombres, pp. 54, BelinPour La Science, Paris 2000.


LINKS

T. D. Noe, Table of n, a(n) for n = 0..100 (using Hickerson's formula)
John V. Baxley, Euler's constant, Taylor's formula, and slowly converging series, Math. Mag. 65 (1992), 302313.
R. P. Boas, Jr. and J. W. Wrench, Jr., Partial sums of the harmonic series, Amer. Math. Monthly, 78 (1971), 864870.
N. Hobson, Harmonic Sum.


FORMULA

Note that the conditionally convergent series Sum_{ k >= 1 } (1)^(k+1)/k = log 2 (A002162).
Lim as n > inf. a(n+1)/a(n) = e.  Robert G. Wilson v, Dec 07 2001
It is conjectured that, for n>1, a(n) = floor(exp(ngamma)+1/2).  Benoit Cloitre, Oct 23 2002


MAPLE

P:=proc(q) local a, b, c, n; print(1); a:=0; c:=0;
for n from 1 to q do a:=a+1/n; b:=ceil(a)a; if b>c then print(n); fi;
c:=b; od; print(); end: P(10^9); # Paolo P. Lava, Mar 27 2014


MATHEMATICA

fh[0]=0; fh[1]=1; fh[k_] := Module[{tmp}, If[Floor[tmp=Log[k+1/2]+EulerGamma]==Floor[tmp+1/(24k^2)], Floor[tmp], UNKNOWN]]; a[0]=1; a[1]=2; a[n_] := Module[{val}, val=Round[Exp[nEulerGamma]]; If[fh[val]==n&&fh[val1]==n1, val, UNKNOWN]]; (* fh[k] is either floor(H(k)) or UNKNOWN *)
a[n_] := Floor[Exp[n  EulerGamma] + 1/2]; Table[a[n], {n, 0, 28}] (* JeanFrançois Alcover, Sep 18 2013, after Charles R Greathouse IV's conjectural formula *)


PROG

(PARI) a(n)=floor(exp(nEuler)+1/2) \\ conjectural
\\ Charles R Greathouse IV, Jun 15 2011
(PARI) a(n)=if(n, my(k=exp(nEuler)); ceil(solve(x=k1.5, k+.5, intnum(y=0, 1, (1y^x)/(1y))n)), 1) \\ Charles R Greathouse IV, Jun 13 2012
(Haskell)
a002387 n = a002387_list !! n
a002387_list = f 0 1 where
f x k = if hs !! k > fromIntegral x
then k : f (x + 1) (k + 1) else f x (k + 1)
where hs = scanl (+) 0 $ map recip [1..]
 Reinhard Zumkeller, Aug 04 2014


CROSSREFS

Apart from initial terms, same as A004080.
Cf. A055980, A115515, A242654.
Sequence in context: A102814 A193059 A034770 * A148160 A148161 A148162
Adjacent sequences: A002384 A002385 A002386 * A002388 A002389 A002390


KEYWORD

nonn,nice,changed


AUTHOR

N. J. A. Sloane


EXTENSIONS

Terms for n >= 13 computed by Eric W. Weisstein; corrected by James R. Buddenhagen and Eric W. Weisstein, Feb 18 2001
Edited by Dean Hickerson, Apr 19 2003
a(27) from Thomas Gettys (tpgettys(AT)comcast.net), Dec 05 2006
a(28) from Thomas Gettys (tpgettys(AT)comcast.net), Jan 21 2007


STATUS

approved



