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.
%I A215001 #13 Mar 04 2024 16:37:30 %S A215001 3,5,7,9,10,12,14,16,17,19,21,23,25,26,28,30,32,33,35,37,39,41,42,44, %T A215001 46,48,49,51,53,55,57,58,60,62,64,66,67,69,71,73,74,76,78,80,82,83,85, %U A215001 87,89,90,92,94,96,98,99,101,103,105,106,108,110,112,114,115 %N A215001 a(n) = 1 + floor(e^(1 + 1/2 + 1/3 + ... + 1/n)). %C A215001 a(n) is the least integer k for which log k > 1 + 1/2 + ... + 1/n. %H A215001 Clark Kimberling, <a href="/A215001/b215001.txt">Table of n, a(n) for n = 1..10000</a> %F A215001 a(n) = A215000(n)+1. %e A215001 log 2 < 1 < log 3, so a(1) = 3; %e A215001 log 4 < 1 + 1 + 1/2 < log 5, so a(2) = 5; %e A215001 log 6 < 1 + 1/2 + 1/3 < log 7, so a(3) = 7. %t A215001 f[n_] := Sum[1/h, {h, n}]; Table[Ceiling[E^f[n]], {n, 100}] %t A215001 Floor[E^HarmonicNumber[Range[70]]]+1 (* _Harvey P. Dale_, Mar 04 2024 *) %o A215001 (PARI) for(n=1,30, print1(1 + floor(exp(sum(k=1,n,1/k))), ", ")) \\ _G. C. Greubel_, Feb 01 2018 %o A215001 (Magma) [1 + Floor(Exp((&+[1/k :k in [1..n]]))): n in [1..30]]; // _G. C. Greubel_, Feb 01 2018 %Y A215001 Cf. A215000. %K A215001 nonn %O A215001 1,1 %A A215001 _Clark Kimberling_, Aug 18 2012