Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069993
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069993 2^(2n+1)*sum(k=1,2n,C(2n+1,k)*B(k)/2^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers. +0
1
5, 27, 121, 503, 2037, 8179, 32753, 131055, 524269, 2097131, 8388585, 33554407, 134217701, 536870883, 2147483617, 8589934559, 34359738333, 137438953435, 549755813849, 2199023255511, 8796093022165, 35184372088787 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=2(4^n-n)-1. a(n)=2*A024037(n)-1 [From Rolf Pleisch (r_pleisch(AT)gmx.ch), Aug 09 2009]

PROGRAM

(PARI) for(n=1, 30, print1(-2*4^n*sum(i=1, 2*n+1, binomial(2*n+1, i)*bernfrac(i)/2^i), ", "))

CROSSREFS

A024037 [From Rolf Pleisch (r_pleisch(AT)gmx.ch), Aug 09 2009]

Sequence in context: A135713 A085740 A129868 this_sequence A009027 A037498 A084177

Adjacent sequences: A069990 A069991 A069992 this_sequence A069994 A069995 A069996

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 01 2002

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research