Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106268 Number triangle T(n,k)=binomial(k-n,n-k)(-1)^(n-k)= if(k<=n, (0^(n-k)+binomial(2(n-k),n-k))/2,0); Riordan array (1/(2-C(x)),x) where C(x) is g.f. for Catalan numbers A000108. +0
3
1, 1, 1, 3, 1, 1, 10, 3, 1, 1, 35, 10, 3, 1, 1, 126, 35, 10, 3, 1, 1, 462, 126, 35, 10, 3, 1, 1, 1716, 462, 126, 35, 10, 3, 1, 1, 6435, 1716, 462, 126, 35, 10, 3, 1, 1, 24310, 6435, 1716, 462, 126, 35, 10, 3, 1, 1, 92378, 24310, 6435, 1716, 462, 126, 35, 10, 3, 1, 1, 352716 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Triangle includes A088218.

Rows sums are A024718. Diagonal sums are A106269. Inverse is A106270.

EXAMPLE

Triangle begins

1;

1,1;

3,1,1;

10,3,1,1;

35,10,3,1,1;

CROSSREFS

Sequence in context: A106340 A118180 A045912 this_sequence A060543 A060540 A087647

Adjacent sequences: A106265 A106266 A106267 this_sequence A106269 A106270 A106271

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 28 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research