login

Revision History for A331431

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) = (-1)^(n+k)*(n+k+1)*binomial(n,k)*binomial(n+k,k) for n >= k >= 0.
(history; published version)
#83 by Michael De Vlieger at Thu Dec 19 23:40:38 EST 2024
STATUS

reviewed

approved

#82 by Andrew Howroyd at Thu Dec 19 22:49:10 EST 2024
STATUS

proposed

reviewed

#81 by Jason Yuen at Thu Dec 19 22:09:26 EST 2024
STATUS

editing

proposed

#80 by Jason Yuen at Thu Dec 19 22:09:22 EST 2024
FORMULA

Sum_{k=0..n}( (-1)^k*T(n, k) = (-1)^n*A108666(n+1) (alternating row sums).

STATUS

approved

editing

#79 by N. J. A. Sloane at Tue Oct 18 19:12:14 EDT 2022
STATUS

editing

approved

#78 by N. J. A. Sloane at Tue Oct 18 19:12:10 EDT 2022
LINKS

J. Ser, <a href="/A002720/a002720_4.pdf">Les Calculs Formels des Séries de Factorielles</a>, Gauthier-Villars, Paris, 1933 [Local copy].

STATUS

approved

editing

#77 by N. J. A. Sloane at Thu Mar 24 04:00:23 EDT 2022
STATUS

proposed

approved

#76 by G. C. Greubel at Tue Mar 22 17:32:38 EDT 2022
STATUS

editing

proposed

#75 by G. C. Greubel at Tue Mar 22 17:32:07 EDT 2022
LINKS

G. C. Greubel, <a href="/A331431/b331431.txt">Rows n = 0..50 of the triangle, flattened</a>

FORMULA

T(n, 0) = (-1)^n*A000027(n+1).

T(n, 1) = A331433(n-1) = (-1)^(n+1)*A007531(n+2).

T(n, 2) = A331434(n-2) = (-1)^n*A054559(n+3).

T(n, n-2) = A002738(n-2).

T(n, n-1) = (-1)*A002736(n).

T(n, n) = A002457(n).

T(2*n, n) = (-1)^n*(3*n+1)!/(n!)^3 = (-1)^n*A331322(n).

Sum_{k=0..n} T(n, k) = A000290(n+1) (row sums).

Sum_{k=0..n}((-1)^k*T(n, k) = (-1)^n*A108666(n+1) (alternating row sums).

Sum_{k=0..n} T(n-k, k) = (-1)^n*A109188(n+1) (diagonal sums).

2^n*Sum_{k=0..n} T(n, k)/2^k = (-1)^floor(n/2)*A100071(n+1) (positive half sums).

(-2)^n*Sum_{k=0..n} T(n, k)/(-2)^k = A331323(n) (negative half sums).

T(2*n+1, n) = (-2)*(-27)^n*Pochhammer(4/3, n)*Pochhammer(5/3, n)/(n!*(n+1)!). - G. C. Greubel, Mar 22 2022

MATHEMATICA

Table[(-1)^(n+k)*(n+k+1)*Binomial[2*k, k]*Binomial[n+k, n-k], {n, 0, 15}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 22 2022 *)

PROG

(Magma) [(-1)^(n+k)*(k+1)*(2*k+1)*Binomial(n+k+1, n-k)*Catalan(k): k in [0..n], n in [0..15]]; // G. C. Greubel, Mar 22 2022

(Sage) flatten([[(-1)^(n+k)*(2*k+1)*binomial(2*k, k)*binomial(n+k+1, n-k) for k in (0..n)] for n in (0..15)]) # G. C. Greubel, Mar 22 2022

CROSSREFS

Row sums: Sum_{k=0..n} T(n, k) = A000290(n+1).

Alternating row sums: Sum_{k=0..n}((-1)^k*T(n, k) = (-1)^n*A108666(n+1).

Diagonal sums: Sum_{k=0..n} T(n-k, k) = (-1)^n*A109188(n+1).

Positive half sums: 2^n*Sum_{k=0..n} T(n, k)/2^k = (-1)^floor(n/2)*A100071(n+1).

Negative half sums: (-2)^n*Sum_{k=0..n} T(n, k)/(-2)^k = A331323(n).

Central values: T(2*n, n) = (-1)^n*(3*n+1)!/(n!)^3 = (-1)^n*A331322(n).

Cf. A000290 (row sums), A002457, , A100071, A108666 (alternating row sums), A109188 (diagonal sums), A331322, A331323, A331430, A331432.

STATUS

approved

editing

#74 by Joerg Arndt at Sun Jul 12 03:34:30 EDT 2020
STATUS

reviewed

approved