[go: up one dir, main page]

login
Revision History for A126953 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.
(history; published version)
#20 by Alois P. Heinz at Tue Sep 17 20:55:15 EDT 2024
STATUS

proposed

approved

#19 by Jason Yuen at Tue Sep 17 20:43:43 EDT 2024
STATUS

editing

proposed

#18 by Jason Yuen at Tue Sep 17 20:43:39 EDT 2024
COMMENTS

This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = x*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + y*T(n-1,k) + T(n-1,k+1) for k >= 1. Other triangles arise from choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; ((1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906. - Philippe Deléham, Sep 25 2007

STATUS

approved

editing

#17 by Susanna Cuyler at Mon Jan 20 21:41:51 EST 2020
STATUS

proposed

approved

#16 by Jon E. Schoenfield at Mon Jan 20 15:39:32 EST 2020
STATUS

editing

proposed

#15 by Jon E. Schoenfield at Mon Jan 20 15:38:52 EST 2020
NAME

Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.

COMMENTS

This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = x*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + y*T(n-1,k) + T(n-1,k+1) for k >= 1 . Other triangles arise by from choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; ((1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906. - Philippe Deléham, Sep 25 2007

FORMULA

Sum_{k, =0<=k<=..n} T(n,k) = A127359(n).

Sum_{k, k>=0} T(m,k)*T(n,k) = T(m+n,0) = A126931(m+n).

Sum_{k, =0<=k<=..n} T(n,k)*(-2*k+1) = 2^n. - Philippe Deléham, Mar 25 2007

EXAMPLE

1;

3, 1;

10, 3, 1;

33, 11, 3, 1;

110, 36, 12, 3, 1;

366, 122, 39, 13, 3, 1;

1220, 405, 135, 42, 14, 3, 1;

4065, 1355, 447, 149, 45, 15, 3, 1;

STATUS

approved

editing

#14 by Michel Marcus at Sat Apr 22 04:38:33 EDT 2017
STATUS

reviewed

approved

#13 by Joerg Arndt at Sat Apr 22 04:09:29 EDT 2017
STATUS

proposed

reviewed

#12 by Michel Marcus at Sat Apr 22 01:56:59 EDT 2017
STATUS

editing

proposed

#11 by Michel Marcus at Sat Apr 22 01:56:55 EDT 2017
COMMENTS

This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=x*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+y*T(n-1,k)+T(n-1,k+1) for k>=1 . Other triangles arise by choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; ((1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906 . - Philippe Deléham, Sep 25 2007

FORMULA

Sum_{k, 0<=k<=n} T(n,k) = A127359(n).

Sum_{k, 0<=k<=n}T(n,k)=A127359(n) . Sum_{k, k>=0} T(m,k)*T(n,k) = T(m+n,0) = A126931(m+n).

Sum_{k, 0<=k<=n} T(n,k)*(-2*k+1) = 2^n . - Philippe Deléham, Mar 25 2007

STATUS

proposed

editing