%I #60 Jun 25 2024 18:50:09
%S 1,8,57,419,3092,22846,168804,1247298,9216354,68100151,503195829,
%T 3718142208,27473561358,203003686106,1500005624924,11083625711271,
%U 81897532160125,605145459495141,4471453748222757,33039822589391676,244133102611731231,1803913190804074904,13329215764452299411
%N a(n) = A092318(n) + 1: Number of terms of the odd harmonic series 1 + 1/3 + 1/5 + 1/7 + ... required to reach a sum >= n.
%C A different way of listing the sums mentioned in A092318.
%C A092318 is the main entry for this problem.
%H Gerhard Kirchner, <a href="/A281355/b281355.txt">Table of n, a(n) for n = 1..1000</a> [replacing an older version by Vincenzo Librandi]
%H Jerry V Polfer, <a href="http://list.seqfan.eu/oldermail/seqfan/2017-January/017225.html">found a new sequence, not sure if interesting, and how to properly submit</a>, Seqfan list, Jan. 22, 2017 (and follow-up messages).
%H Albert Säfström, <a href="/A281355/a281355.txt">n describes the expected number of loops created by tieing together two random loose ends of a(n) ropes until there is none left.</a>
%F Lim_{n -> oo} a(n)/exp(2*n) = 1/4e^gamma ~ 0.140364870891721292456...;
%F a(n) = floor(exp(2*n-gamma)/4+1), for all given values a(n) > 1. - _M. F. Hasler_ and _Robert G. Wilson v_, Jan 23 2017 [corrected by _Gerhard Kirchner_, Jul 25 2020]
%t a[n_]:=Floor[Exp[2*n-EulerGamma]/4+1]-Boole[n==1]; Array[a,23] (* _Stefano Spezia_, Jun 25 2024 *)
%Y Cf. A002387, A092318.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Jan 22 2017, following a suggestion from _Jerry Polfer_
%E More explicit, self-contained definition by _M. F. Hasler_, Jan 22 2017
%E More terms (computed using A056053) from _M. F. Hasler_, Jan 23 2017
%E a(17) corrected in data and 127 terms in the b-file, according to the corrections in A092315, _Gerhard Kirchner_, Jul 27 2020