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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092785 Sum(sum(binomial(j-n-1,m),m=0..n),j=0..n). 2
1, -1, 7, -21, 81, -295, 1107, -4165, 15793, -60171, 230253, -884235, 3406105, -13154947, 50922987, -197519941, 767502945, -2987013067, 11641557717, -45429853651, 177490745985, -694175171647, 2717578296117, -10648297329691, 41757352712481, -163875286898935 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..500

FORMULA

Differs from A072547 by -1, +1, -1, +1, -1, ... - Ralf Stephan, Apr 19 2004.

Equals sum(m=0, n, (-1)^m*binomial(n+m, m)). - Henry Gould, Apr 23, 2004

Let f(n) = (-1)^n a(n). Then 2f(n) + f(n-1) = (3n+1)C(n) + (-1)^n, where C(n) = (2n+1)!/n!(n+1)! is a Catalan number (A000108). - Henry Gould, Apr 24, 2004

CROSSREFS

Sequence in context: A146247 A147003 A110683 * A114902 A177369 A164544

Adjacent sequences:  A092782 A092783 A092784 * A092786 A092787 A092788

KEYWORD

sign

AUTHOR

Francois Jooste (pin(AT)myway.com), Apr 23 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 16 05:39 EST 2012. Contains 205860 sequences.