login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215000 a(n) = floor(exp(1 + 1/2 + 1/3 + ... + 1/n)). 2

%I #28 Sep 08 2022 08:46:03

%S 2,4,6,8,9,11,13,15,16,18,20,22,24,25,27,29,31,32,34,36,38,40,41,43,

%T 45,47,48,50,52,54,56,57,59,61,63,65,66,68,70,72,73,75,77,79,81,82,84,

%U 86,88,89,91,93,95,97,98,100,102,104,105,107,109,111,113,114

%N a(n) = floor(exp(1 + 1/2 + 1/3 + ... + 1/n)).

%C a(n) is the greatest integer k for which log k < 1 + 1/2 + ... + 1/n.

%C a(n) is asymptotically equals to n*e^(gamma) for large values of n where 'gamma' is the Euler-Mascheroni constant(Cf. A001620). - Balarka Sen, Aug 19 2012

%H Clark Kimberling, <a href="/A215000/b215000.txt">Table of n, a(n) for n = 1..10000</a>

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

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

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

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

%t Table[Floor[Exp[HarmonicNumber[n]]], {n, 1, 100}] (* _G. C. Greubel_, Aug 30 2018 *)

%o (PARI) a(n) = floor(exp(sum(X=1,n,1/X))) \\ _Balarka Sen_, Aug 19 2012

%o (Magma) [Floor(Exp((&+[1/k :k in [1..n]]))): n in [1..30]]; // _G. C. Greubel_, Feb 01 2018

%Y Cf. A215001, A001620, A073004.

%K nonn

%O 1,1

%A _Clark Kimberling_, Aug 18 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)