Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107105
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107105 Triangle, read by rows, where T(n,k) = C(n,k)*(C(n,k) + 1)/2, n>=k>=0. +0
2
1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 1, 10, 21, 10, 1, 1, 15, 55, 55, 15, 1, 1, 21, 120, 210, 120, 21, 1, 1, 28, 231, 630, 630, 231, 28, 1, 1, 36, 406, 1596, 2485, 1596, 406, 36, 1, 1, 45, 666, 3570, 8001, 8001, 3570, 666, 45, 1, 1, 55, 1035, 7260, 22155, 31878, 22155, 7260 (list; table; graph; listen)
OFFSET

0,5

FORMULA

n-th row sum equals A005317(n) = (C(2n, n) + 2^n)/2.

EXAMPLE

Triangle begins:

1;

1,1;

1,3,1;

1,6,6,1;

1,10,21,10,1;

1,15,55,55,15,1;

1,21,120,210,120,21,1;

1,28,231,630,630,231,28,1; ...

PROGRAM

(PARI) T(n, k)=binomial(n, k)*(binomial(n, k)+1)/2

CROSSREFS

Cf. A005317 (row sums), A107597 (antidiagonal sums).

Sequence in context: A162745 A001263 A162747 this_sequence A088925 A100862 A098568

Adjacent sequences: A107102 A107103 A107104 this_sequence A107106 A107107 A107108

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 21 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research