Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116384
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116384 Diagonal sums of the Riordan array A116382. +0
2
1, 0, 3, 1, 10, 6, 36, 28, 135, 121, 517, 507, 2003, 2093, 7815, 8569, 30634, 34902, 120480, 141664, 475002, 573574, 1876294, 2318010, 7422676, 9354540, 29400192, 37708672, 116567356, 151868100, 462561572, 611180252, 1836843591, 2458123705 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=sum{k=0..floor(n/2), sum{j=0..n-k, (-1)^(n-k-j)*C(n-k,j)*sum{i=0..j, C(j,i-k)C(i,j-i)}}}.

CROSSREFS

Sequence in context: A035324 A091965 A107056 this_sequence A117207 A046658 A124574

Adjacent sequences: A116381 A116382 A116383 this_sequence A116385 A116386 A116387

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Feb 12 2006

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research