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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078718 Let f(i,j) = Sum(binomial(2*i,k)*binomial(2*j,i+j-k)*(-1)^(i+j-k),k=0..2*i) (this is essentially the same as the triangle in A068555); then a(n) = f(n,n-2)/2. 1
0, 1, 3, -5, 14, -45, 154, -546, 1980, -7293, 27170, -102102, 386308, -1469650, 5616324, -21544100, 82907640, -319929885, 1237518450, -4796857230, 18627909300, -72457790790, 282257178060, -1100982015900, 4299680491080, -16809921068850, 65785111513524, -257683159276956 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..27.

Guo-Niu Han, Enumeration of Standard Puzzles

CROSSREFS

Cf. A068555. Apart perhaps from signs, f(n, 0) and f(n, n) give A000984, f(n, 1) gives A002420, f(n, n-1) gives 2*A000984.

Sequence in context: A222380 A052974 A006395 * A081393 A129326 A167553

Adjacent sequences:  A078715 A078716 A078717 * A078719 A078720 A078721

KEYWORD

sign

AUTHOR

N. J. A. Sloane, Dec 20 2002

STATUS

approved

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 June 18 03:02 EDT 2013. Contains 226328 sequences.