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!)
A085115 Numerator of G(n)=sum(k=1,n,1/2^k/2*sum(j=0,k-1,1/binomial(2^(k-j)+j,j))). 1

%I #12 May 30 2020 05:06:35

%S 1,5,241,1561,96029,8580709,1707931151,147403551109,1271289370866337,

%T 18501833565256581935,1745474502799550774494057,

%U 35091068020856449153974443861,12840452368911027932139293073746831113

%N Numerator of G(n)=sum(k=1,n,1/2^k/2*sum(j=0,k-1,1/binomial(2^(k-j)+j,j))).

%D David H. Bailey and Richard E. Crandall, Random Generators and Normal Numbers, 2000.

%H M. Beeler, R. W. Gosper and R. Schroeppel, <a href="https://dspace.mit.edu/handle/1721.1/6086">HAKMEM</a>, Cambridge, MA: MIT Artificial Intelligence Laboratory, Memo AIM-239, Feb. 1972, Item 120, page 55. Also <a href="http://www.inwap.com/pdp10/hbaker/hakmem/series.html#item120">HTML transcription</a>.

%F lim n-->oo G(n) = Gamma constant = 0.5772....

%o (PARI) a(n)=numerator(sum(k=1,n,1/2^k/2*sum(j=0,k-1,1/binomial(2^(k-j)+j,j))))

%Y Cf. A085116 (denominators).

%K frac,nonn

%O 0,2

%A _Benoit Cloitre_, Aug 10 2003

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 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)