0,5

T(2n,n) is A114198. Row sums are A114199. Row sums of inverse are 0^n.

Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.

As a number triangle, T(n, k)=sum{j=0..n-k, C(n-k, j)C(k, j)F(j)}; As a number triangle, T(n, k)=sum{j=0..n, C(n-k, n-j)C(k, j-k)F(j-k)}; As a number triangle, T(n, k)=if(k<=n, sum{j=0..n, C(k, j)C(n-k, n-j)F(k-j)}, 0); As a square array, T(n, k)=sum{j=0..n, C(n, j)C(k, j)F(j)}; As a square array, T(n, k)=sum{j=0..n+k, C(n, n+k-j)C(k, j-k)F(j-k)}; Column k has g.f. sum{j=0..k, C(k, j)F(j+1)(x/(1-x))^j}x^k/(1-x);

Triangle begins

1;

1, 1;

1, 2, 1;

1, 3, 3, 1;

1, 4, 7, 4, 1;

1, 5, 13, 13, 5, 1;

1, 6, 21, 31, 21, 6, 1;

1, 7, 31, 61, 61, 31, 6, 1;

1, 8, 43,106,142,106, 43, 8, 1;

Sequence in context: A166293 A094525 A130671 this_sequence A108350 A086617 A094526

Adjacent sequences: A114194 A114195 A114196 this_sequence A114198 A114199 A114200

easy,nonn,tabl

Paul Barry (pbarry(AT)wit.ie), Nov 16 2005