Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061053
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061053 (n+1)! sum{k=0 to n}[binomial(2k,k) B_{n-k}], where B_n is n-th Bernoulli number. +0
1
1, 3, 31, 416, 7316, 158592, 4079832, 121418880, 4102640064, 155127605760, 6488944560000, 297483185986560, 14831664692912640, 798949604318423040, 46240823333993702400, 2861614126455843225600, 188557593322666066329600 (list; graph; listen)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

a(3) = 4! *(binomial(0,0) B_3 + binomial(2,1) B_2 + binomial(4,2) B_1 + binomial(6,3) B_0) = 24 *(1 *0 + 2 *(1/6) + 6 *(-1/2) + 20 *1) = 416.

PROGRAM

(PARI) { default(realprecision, 500); for (n=0, 100, a=(n + 1)!*sum(k=0, n, binomial(2*k, k)*bernreal(n - k)); write("b061053.txt", n, " ", round(a)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 17 2009]

CROSSREFS

Sequence in context: A014178 A123818 A087591 this_sequence A047798 A126346 A142999

Adjacent sequences: A061050 A061051 A061052 this_sequence A061054 A061055 A061056

KEYWORD

easy,nonn

AUTHOR

Leroy Quet May 26 2001

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 01:21 EDT 2010. Contains 173643 sequences.


AT&T Labs Research