Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123162
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123162 Triangle read by rows: binomial[2*n-1,2*m-1]. +0
2
1, 1, 1, 1, 3, 1, 1, 5, 10, 1, 1, 7, 35, 21, 1, 1, 9, 84, 126, 36, 1, 1, 11, 165, 462, 330, 55, 1, 1, 13, 286, 1287, 1716, 715, 78, 1, 1, 15, 455, 3003, 6435, 5005, 1365, 105, 1, 1, 17, 680, 6188, 19448, 24310, 12376, 2380, 136, 1, 1, 19, 969, 11628, 50388, 92378, 75582 (list; table; graph; listen)
OFFSET

1,5

COMMENT

Column k has g.f. x^k*sum{j=0..k, C(2k,2j)*x^j}/(1-x)^(2k+0^k); - Paul Barry (pbarry(AT)wit.ie), May 26 2008

FORMULA

a(n,m) = If [n == m == 0 || m == 0, 1, (2*n - 1)!/((2*(n - m))!*(2*m - 1)!)]

a(n,k)=C(2n-1,2k-1)+0^n+0^k+0^(n+k); - Paul Barry (pbarry(AT)wit.ie), May 26 2008

EXAMPLE

1

1, 1

1, 3, 1

1, 5, 10, 1

1, 7, 35, 21, 1

1, 9, 84, 126, 36, 1

1, 11, 165, 462, 330, 55, 1

MATHEMATICA

t[n_, m_] = If [n == m == 0 || m == 0, 1, (2*n - 1)!/((2*(n - m))!*(2*m - 1)!)]; a = Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[a]

CROSSREFS

Sequence in context: A118538 A141523 A086385 this_sequence A083075 A069972 A115017

Adjacent sequences: A123159 A123160 A123161 this_sequence A123163 A123164 A123165

KEYWORD

nonn,tabl

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 02 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 04 2006

page 1

Search completed in 0.005 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research