login
Triangle read by rows: a[n, m] = a[n - 1, m] + binomial[n, m]; n <=m
0

%I #4 Mar 12 2014 16:36:46

%S 1,1,2,1,5,2,1,11,6,2,1,21,16,7,2,1,36,36,22,8,2,1,57,71,57,29,9,2,1,

%T 85,127,127,85,37,10,2,1,121,211,253,211,121,46,11,2,1,166,331,463,

%U 463,331,166,56,12,2,1,221,496,793,925,793,496,221,67,13,2,1,287,716,1288,1717

%N Triangle read by rows: a[n, m] = a[n - 1, m] + binomial[n, m]; n <=m

%C Triangular binomial sequence related to Pascal's triangle.

%e Triangle levels:

%e 1

%e 1,2

%e 1,5,2

%e 1,11,6,2

%e 1,21,16,7,2

%e 1,36,36,22,8,2

%e 1,57,71,57,29,9,2

%t a[0, 0] = 1; a[1, 0] = 1; a[n_, 1] := a[n, 1] = 1; a[1, m_] := a[1, m] = 1 a[n_, m_] := a[n, m] = a[n - 1, m] + Binomial[n, m];

%K nonn,tabl

%O 0,3

%A _Roger L. Bagula_, Apr 06 2005