login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A144480
T(n,k) = binomial(n, k)*min(k + 1, n - k + 1), triangle read by rows (n >= 0, 0 <= k <= n).
1
1, 1, 1, 1, 4, 1, 1, 6, 6, 1, 1, 8, 18, 8, 1, 1, 10, 30, 30, 10, 1, 1, 12, 45, 80, 45, 12, 1, 1, 14, 63, 140, 140, 63, 14, 1, 1, 16, 84, 224, 350, 224, 84, 16, 1, 1, 18, 108, 336, 630, 630, 336, 108, 18, 1, 1, 20, 135, 480, 1050, 1512, 1050, 480, 135, 20, 1
OFFSET
0,5
FORMULA
If k <= floor(n/2), then T(n,k) = binomial(n, k)*(k + 1), otherwise T(n,k) = binomial(n, k)*(n - k - 1).
T(n,k) = A007318(n,k)*A003983(k+1,n-k+1), i.e., term-by term product of Pascal's triangle A007318 and A003983 as a triangle.
EXAMPLE
Triangle begins:
1;
1, 1;
1, 4, 1;
1, 6, 6, 1;
1, 8, 18, 8, 1;
1, 10, 30, 30, 10, 1;
1, 12, 45, 80, 45, 12, 1;
1, 14, 63, 140, 140, 63, 14, 1;
1, 16, 84, 224, 350, 224, 84, 16, 1;
1, 18, 108, 336, 630, 630, 336, 108, 18, 1;
1, 20, 135, 480, 1050, 1512, 1050, 480, 135, 20, 1;
...
MATHEMATICA
Table[Table[Binomial[n, m]*If[m <= Floor[n/2], 1 + m, 1 + n - m], {m, 0, n}], {n, 0, 10}] // Flatten
PROG
(Maxima) create_list(binomial(n, k)*min(k + 1, n - k + 1), n, 0, 10, k, 0, n); /* Franck Maminirina Ramaharo, Dec 10 2018 */
CROSSREFS
Row sums are in A245560.
Sequence in context: A141540 A143188 A102413 * A144463 A174376 A131399
KEYWORD
nonn,easy,tabl
AUTHOR
Roger L. Bagula, Oct 11 2008
EXTENSIONS
Entry revised by N. J. A. Sloane, Aug 07 2014
Edited by Franck Maminirina Ramaharo, Dec 10 2018
STATUS
approved