login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107105 Triangle, read by rows, where T(n,k) = C(n,k)*(C(n,k) + 1)/2, n>=k>=0. 1
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; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
Replace each number x in Pascal's triangle by x(x+1)/2. - Charlie Marion, May 31 2013
LINKS
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; ...
PROG
(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 * A088925 A100862 A098568
KEYWORD
nonn,tabl,easy
AUTHOR
Paul D. Hanna, May 21 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 05:10 EDT 2024. Contains 372227 sequences. (Running on oeis4.)