cp's OEIS Frontend

A368043 Triangle read by rows: T(n, k) = 2^(n + k).

%I A368043 #15 Dec 09 2023 15:36:11
%S A368043 1,2,4,4,8,16,8,16,32,64,16,32,64,128,256,32,64,128,256,512,1024,64,
%T A368043 128,256,512,1024,2048,4096,128,256,512,1024,2048,4096,8192,16384,256,
%U A368043 512,1024,2048,4096,8192,16384,32768,65536,512,1024,2048,4096,8192,16384,32768,65536,131072,262144
%N A368043 Triangle read by rows: T(n, k) = 2^(n + k).
%F A368043 G.f.: 1/((1 - 2*x)*(1 - 4*x*y)). - _Stefano Spezia_, Dec 09 2023
%e A368043 [0]  [  1]
%e A368043 [1]  [  2,   4]
%e A368043 [2]  [  4,   8,  16]
%e A368043 [3]  [  8,  16,  32,    64]
%e A368043 [4]  [ 16,  32,  64,   128,  256]
%e A368043 [5]  [ 32,  64,  128,  256,  512, 1024]
%e A368043 [6]  [ 64, 128,  256,  512, 1024, 2048,  4096]
%e A368043 [7]  [128, 256,  512, 1024, 2048, 4096,  8192, 16384]
%e A368043 [8]  [256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536]
%t A368043 Array[2^Range[#,2#]&,10,0] (* _Paolo Xausa_, Dec 09 2023 *)
%o A368043 (Python)
%o A368043 from functools import cache
%o A368043 @cache
%o A368043 def T_row(n: int) -> list[int]:
%o A368043     if n == 0: return [1]
%o A368043     row = T_row(n - 1) + [0]
%o A368043     for k in range(n): row[k] *= 2
%o A368043     row[n] = row[n - 1] * 2
%o A368043     return row
%o A368043 for n in range(11): print(T_row(n))
%Y A368043 Cf. A000079 (T(n,0)), A004171 (T(n,n-1)), A000302 (T(n,n)), A171476 (row sums), A003683 (alternating row sums), A134353 (antidiagonal sums), A001018 (T(2n, n)), A094014 (T(n, n/2)), A002697.
%K A368043 nonn,tabl
%O A368043 0,2
%A A368043 _Peter Luschny_, Dec 09 2023