login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215001 a(n) = 1 + floor(e^(1 + 1/2 + 1/3 + ... + 1/n)). 2
3, 5, 7, 9, 10, 12, 14, 16, 17, 19, 21, 23, 25, 26, 28, 30, 32, 33, 35, 37, 39, 41, 42, 44, 46, 48, 49, 51, 53, 55, 57, 58, 60, 62, 64, 66, 67, 69, 71, 73, 74, 76, 78, 80, 82, 83, 85, 87, 89, 90, 92, 94, 96, 98, 99, 101, 103, 105, 106, 108, 110, 112, 114, 115 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) is the least integer k for which log k > 1 + 1/2 + ... + 1/n.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A215000(n)+1.

EXAMPLE

log 2 < 1 < log 3, so a(1) = 3;

log 4 < 1 + 1 + 1/2 < log 5, so a(2) = 5;

log 6 < 1 + 1/2 + 1/3 < log 7, so a(3) = 7.

MATHEMATICA

f[n_] := Sum[1/h, {h, n}]; Table[Ceiling[E^f[n]], {n, 100}]

PROG

(PARI) for(n=1, 30, print1(1 + floor(exp(sum(k=1, n, 1/k))), ", ")) \\ G. C. Greubel, Feb 01 2018

(MAGMA) [1 + Floor(Exp((&+[1/k :k in [1..n]]))): n in [1..30]]; // G. C. Greubel, Feb 01 2018

CROSSREFS

Cf. A215000.

Sequence in context: A186381 A208672 A186153 * A187318 A262770 A108598

Adjacent sequences:  A214998 A214999 A215000 * A215002 A215003 A215004

KEYWORD

nonn

AUTHOR

Clark Kimberling, Aug 18 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 18:42 EST 2021. Contains 340352 sequences. (Running on oeis4.)