login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096045 a(n)=B(2n,2)/B(2n) (see comment). 14
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; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

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

PROG

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

(MAGMA) [3*4^n-2: n in [0..30]]; // Vincenzo Librandi, Aug 13 2011

CROSSREFS

Cf. A096046, A096047, A096048.

Sequence in context: A024166 A103501 A003197 * A183133 A115712 A199313

Adjacent sequences:  A096042 A096043 A096044 * A096046 A096047 A096048

KEYWORD

nonn,easy

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.