Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096045
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096045 a(n)=B(2n,2)/B(2n) (see comment). +0
13
1, 10, 46, 190, 766, 3070, 12286, 49150, 196606, 786430, 3145726, 12582910, 50331646, 201326590, 805306366, 3221225470, 12884901886, 51539607550, 206158430206, 824633720830, 3298534883326, 13194139533310, 52776558133246 (list; graph; listen)
OFFSET

0,2

COMMENT

B(n,p)=sum(i=0,n,p^i*sum(j=0,i,binomial(n,j)*B(j))) where B(k)=k-th Bernoulli number

FORMULA

a(n)=3*4^n-2; a(0)=1 a(1)=10 and a(n)=5*a(n-1)-4*a(n-2)

a(n)=4a(n-1)+6. First differences = A002063(n). - Paul Curtz (bpcrtz(AT)free.fr), Jul 07 2008

PROGRAM

(PARI) a(n)=sum(i=0, 2*n, 2^i*sum(j=0, i, binomial(2*n, j)*bernfrac(j)))/bernfrac(2*n)

CROSSREFS

Cf. A096046, A096047, A096048.

Sequence in context: A024166 A103501 A003197 this_sequence A115712 A003765 A138041

Adjacent sequences: A096042 A096043 A096044 this_sequence A096046 A096047 A096048

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 17 2004

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research