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.

Showing 1-1 of 1 results.

A087460 Least n such that H(n) is closer to an integer than any H(j) with j < n; where H(n) is the harmonic number sum_{i=0..n} 1/i.

Original entry on oeis.org

2, 3, 4, 10, 11, 30, 83, 226, 4549, 91379, 91380, 248396, 248397, 675213, 4989190, 4989191, 13562026, 13562027, 36865412, 100210580, 2012783315, 5471312310, 40427833595, 40427833596, 109894245428, 812014744421, 812014744422, 2207284924202, 2207284924203
Offset: 2

Views

Author

Robert G. Wilson v, Sep 03 2003

Keywords

Comments

H(36865412) = 18.000000003719931082993704481490195538573320586002
The inequality, 0.5*log(n^2+n)+gamma < H(n) < 0.5*log(n^2+n)+gamma +1/(6*n^2+6*n) (see Villarino link), where gamma is the Euler-Mascheroni constant, can be used to determine terms of this sequence without directly computing the harmonic numbers. - Steven J. Kifowit, May 26 2015

Crossrefs

Programs

  • Mathematica
    d = 1; s = 1; n = 2; Do[ While[s = N[s + 1/n, 50]; Abs[Round[s] - s] > d, n++ ]; Print[n]; d = Abs[Round[s] - s]; n++, {i, 2, 18}]

Extensions

Corrected and extended by Steven J. Kifowit, May 26 2015
Showing 1-1 of 1 results.