|
%I #8 Sep 08 2022 08:45:30
%S 1,0,2,1,0,4,0,2,0,8,1,0,4,0,16,0,2,0,8,0,32,1,0,4,0,16,0,64,0,2,0,8,
%T 0,32,0,128,1,0,4,0,16,0,64,0,256,0,2,0,8,0,32,0,128,0,512,1,0,4,0,16,
%U 0,64,0,256,0,1024,0,2,0,8,0,32,0,128,0,512,0,2048
%N Triangle defined by A128174 * A130123, read by rows.
%C Row sums = A000975: (1, 2, 5, 10, 21, 42, ...).
%H G. C. Greubel, <a href="/A130125/b130125.txt">Rows n = 0..100 of triangle, flattened</a>
%F A128174 * A130123 as infinite lower triangular matrices. By columns, (2^k, 0, 2^k, 0, ...).
%F T(n,k) = 2^(k-1)*(1 + (-1)^(n-k)). - _G. C. Greubel_, Jun 05 2019
%e First few rows of the triangle are:
%e 1;
%e 0, 2;
%e 1, 0, 4;
%e 0, 2, 0, 8;
%e 1, 0, 4, 0, 16;
%e 0, 2, 0, 8, 0, 32; ...
%t Table[2^(k-1)*(1+(-1)^(n-k)), {n,0,10}, {k,0,n}]//Flatten (* _G. C. Greubel_, Jun 05 2019 *)
%o (PARI) {T(n,k) = 2^(k-1)*(1+(-1)^(n-k))}; \\ _G. C. Greubel_, Jun 05 2019
%o (Magma) [[2^(k-1)*(1+(-1)^(n-k)): k in [0..n]]: n in [0..10]]; // _G. C. Greubel_, Jun 05 2019
%o (Sage) [[2^(k-1)*(1+(-1)^(n-k)) for k in (0..n)] for n in (0..10)] # _G. C. Greubel_, Jun 05 2019
%o (GAP) Flat(List([0..10], n-> List([0..n], k-> 2^(k-1)*(1+(-1)^(n-k)) ))); # _G. C. Greubel_, Jun 05 2019
%Y Cf. A000975, A128174, A130123.
%K nonn,tabl
%O 0,3
%A _Gary W. Adamson_, May 11 2007
%E More terms added by _G. C. Greubel_, Jun 05 2019
|
