Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092785
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092785 Sum(sum(binomial(j-n-1,m),m=0..n),j=0..n). +0
2
1, -1, 7, -21, 81, -295, 1107, -4165, 15793, -60171, 230253, -884235, 3406105, -13154947, 50922987, -197519941, 767502945, -2987013067, 11641557717, -45429853651, 177490745985 (list; graph; listen)
OFFSET

0,3

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 this_sequence A114902 A164544 A100025

Adjacent sequences: A092782 A092783 A092784 this_sequence A092786 A092787 A092788

KEYWORD

sign

AUTHOR

Francois Jooste (pin(AT)myway.com), Apr 23 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research