|
%I #12 Feb 11 2021 02:45:29
%S 1,1,1,1,4,1,1,4,4,1,1,4,6,4,1,1,5,7,7,5,1,1,6,10,8,10,6,1,1,7,15,11,
%T 11,15,7,1,1,8,21,20,10,20,21,8,1,1,9,28,35,16,16,35,28,9,1,1,10,36,
%U 56,35,12,35,56,36,10,1
%N Triangle T(n, k) = binomial(n-k+1, k) + binomial(k+1, n-k) with T(0,0) = T(1, 0) = T(1, 1) = 1, read by rows.
%H G. C. Greubel, <a href="/A174093/b174093.txt">Rows n = 0..100 of the triangle, flattened</a>
%F T(n, k) = binomial(n-k+1, k) + binomial(k+1, n-k) with T(0,0) = T(1, 0) = T(1, 1) = 1.
%F From _G. C. Greubel_, Feb 10 2021: (Start)
%F T(n, k) = A007318(n-k+1, k) + A007318(k+1, n-k), for rows n >= 2.
%F T(n, k) = T(n, n-k).
%F Sum_{k=0..n} T(n, k) = 2*Fibonacci(n+2) - [n=0] - 2*[n=1] = 2*A071679(n) + [n=0], where [] is the Iverson bracket. (End)
%e Triangle begins as:
%e 1;
%e 1, 1;
%e 1, 4, 1;
%e 1, 4, 4, 1;
%e 1, 4, 6, 4, 1;
%e 1, 5, 7, 7, 5, 1;
%e 1, 6, 10, 8, 10, 6, 1;
%e 1, 7, 15, 11, 11, 15, 7, 1;
%e 1, 8, 21, 20, 10, 20, 21, 8, 1;
%e 1, 9, 28, 35, 16, 16, 35, 28, 9, 1;
%e 1, 10, 36, 56, 35, 12, 35, 56, 36, 10, 1;
%t T[n_, k_]:= If[n==0 || n==1, 1, Binomial[n-k+1, k] + Binomial[k+1, n-k]];
%t Table[T[n,k], {n,0,12}, {k,0,n}]//Flatten
%o (Sage)
%o def T(n, k):
%o if (n==0 or n==1): return 1
%o else: return binomial(n-k+1, k) + binomial(k+1, n-k)
%o flatten([[T(n, k) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Feb 10 2021
%o (Magma)
%o T:= func< n,k | n lt 2 select 1 else Binomial(n-k+1, k) + Binomial(k+1, n-k) >;
%o [T(n,k): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Feb 10 2021
%Y Cf. A000045, A007318, A071679.
%Y Cf. A174095, A174096, A174097.
%K nonn,tabl,easy,less
%O 0,5
%A _Roger L. Bagula_, Mar 07 2010
%E Edited by _G. C. Greubel_, Feb 10 2021
|
