cp's OEIS Frontend

A130671 Triangular sequence based on Pascal's triangle: t(n,m) = 2*binomial(m, n) - (1 + n*(m - n)).

%I A130671 #7 Aug 09 2015 01:38:36
%S A130671 1,1,1,1,2,1,1,3,3,1,1,4,7,4,1,1,5,13,13,5,1,1,6,21,30,21,6,1,1,7,31,
%T A130671 57,57,31,7,1,1,8,43,96,123,96,43,8,1,1,9,57,149,231,231,149,57,9,1,1,
%U A130671 10,73,218,395,478,395,218,73,10,1
%N A130671 Triangular sequence based on Pascal's triangle: t(n,m) = 2*binomial(m, n) - (1 + n*(m - n)).
%C A130671 Suggested by _Gary W. Adamson_ from a previous submission. Very close to (but slightly smaller at 7th row) A086617.
%F A130671 t(n,m) = 2*binomial[m, n] - (1 + n*(m - n)).
%e A130671 {1},
%e A130671 {1, 1},
%e A130671 {1, 2, 1},
%e A130671 {1, 3, 3, 1},
%e A130671 {1, 4, 7, 4, 1},
%e A130671 {1, 5, 13, 13, 5, 1},
%e A130671 {1, 6, 21, 30, 21, 6, 1},
%e A130671 {1, 7, 31, 57, 57, 31, 7, 1}
%t A130671 Table[Table[2*Binomial[m, n] - (1 + n*(m - n)), {n, 0, m}], {m, 0, 10}] Flatten[%]
%Y A130671 Cf. A086617.
%K A130671 nonn,tabl
%O A130671 1,5
%A A130671 _Roger L. Bagula_ and _Gary W. Adamson_, Jun 27 2007