Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113214
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113214 Riordan array (1+2x,x(1+x)). +0
2
1, 2, 1, 0, 3, 1, 0, 2, 4, 1, 0, 0, 5, 5, 1, 0, 0, 2, 9, 6, 1, 0, 0, 0, 7, 14, 7, 1, 0, 0, 0, 2, 16, 20, 8, 1, 0, 0, 0, 0, 9, 30, 27, 9, 1, 0, 0, 0, 0, 2, 25, 50, 35, 10, 1, 0, 0, 0, 0, 0, 11, 55, 77, 44, 11, 1, 0, 0, 0, 0, 0, 2, 36, 105, 112, 54, 12, 1, 0, 0, 0, 0, 0, 0, 13, 91, 182, 156, 65, 13, 1 (list; table; graph; listen)
OFFSET

0,2

COMMENT

Row sums are Lucas numbers A000204. Diagonal sums are A007307(n+1). Inverse is (-1)^(n-k)A092392(n,k). Product with Pascal triangle (1/(1-x),x/(1-x)) is A111125.

FORMULA

T(n, k)=C(k, n-k)+2C(k, n-k-1); T(n, k)=sum{j=0..n, (-1)^(n-j)*C(n, j)C(j+k, 2k)(2j+1)/(2k+1)}.

EXAMPLE

Triangle begins

1;

2,1;

0,3,1;

0,2,4,1;

0,0,5,5,1;

0,0,2,9,6,1;

0,0,0,7,14,7,1;

0,0,0,2,16,20,8,1;

CROSSREFS

Sequence in context: A130055 A127013 A117362 this_sequence A029323 A071802 A110355

Adjacent sequences: A113211 A113212 A113213 this_sequence A113215 A113216 A113217

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 18 2005

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 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research