Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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))). +0
2
1, 5, 241, 1561, 96029, 8580709, 1707931151, 147403551109, 1271289370866337, 18501833565256581935, 1745474502799550774494057, 35091068020856449153974443861, 12840452368911027932139293073746831113 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

M. Beeler et al. Item 120 in M. Beeler, R. W. Gosper and R. Schroeppel, HAKMEM, Cambridge, MA: MIT Artificial Intelligence Laboratory, Memo AIM-239, 55, Feb. 1972.

FORMULA

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

PROGRAM

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

CROSSREFS

Cf. A085116.

Sequence in context: A153025 A140518 A142732 this_sequence A144999 A097323 A166943

Adjacent sequences: A085112 A085113 A085114 this_sequence A085116 A085117 A085118

KEYWORD

frac,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 10 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research