|
%I #11 Feb 26 2022 00:36:07
%S 1,2,1,2,2,1,2,4,2,1,2,4,6,2,1,2,6,6,8,2,1,2,6,12,8,10,2,1,2,8,12,20,
%T 10,12,2,1,2,8,20,20,30,12,14,2,1,2,10,20,40,30,42,14,16,2,1,2,10,30,
%U 40,70,42,56,16,18,2,1,2,12,30,70,70,112,56,72,18,20,2,1
%N T(n,k) = 2*A046854(n,k) - I.
%C Row sums = A001595: (1, 3, 5, 9, 15, 25, 41, 67, ...).
%C A131241 = 3*A046854 - 2*I.
%H G. C. Greubel, <a href="/A131240/b131240.txt">Rows n = 0..100 of triangle, flattened</a>
%F T(n,k) = 2*A046854(n,k) - Identity matrix, where A046854 = Pascal's triangle with repeats by columns.
%e First few rows of the triangle:
%e 1;
%e 2, 1;
%e 2, 2, 1;
%e 2, 4, 2, 1;
%e 2, 4, 6, 2, 1;
%e 2, 6, 6, 8, 2, 1;
%e 2, 6, 12, 8, 10, 2, 1;
%e ...
%t Table[If[k==n, 1, 2*Binomial[Floor[(n+k)/2], k]], {n, 0, 12}, {k, 0, n}]//Flatten (* _G. C. Greubel_, Jul 12 2019 *)
%o (PARI) T(n,k) = if(k==n, 1, 2*binomial((n+k)\2, k));
%o (Magma) [k eq n select 1 else 2*Binomial(Floor((n+k)/2), k): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Jul 12 2019
%o (Sage)
%o def T(n, k):
%o if (k==n): return 1
%o else: return 2*binomial(floor((n+k)/2), k)
%o [[T(n, k) for k in (0..n)] for n in (0..12)] # _G. C. Greubel_, Jul 12 2019
%o (GAP)
%o T:= function(n,k)
%o if k=n then return 1;
%o else return 2*Binomial(Int((n+k)/2), k);
%o fi;
%o end;
%o Flat(List([0..12], n-> List([0..n], k-> T(n,k)))); # _G. C. Greubel_, Jul 12 2019
%Y Cf. A001595, A046854, A131241.
%K nonn,tabl
%O 0,2
%A _Gary W. Adamson_, Jun 21 2007
%E More terms added by _G. C. Greubel_, Jul 12 2019
|
