login
Triangle read by rows: T(n,k) = 2 * (k mod 2 + 1) * T(n-1,floor(k/2)) + 1 with T(0,0) = 1 for 0 <= k <= 2^n-1.
1

%I #14 Mar 02 2024 00:03:00

%S 1,3,5,7,13,11,21,15,29,27,53,23,45,43,85,31,61,59,117,55,109,107,213,

%T 47,93,91,181,87,173,171,341,63,125,123,245,119,237,235,469,111,221,

%U 219,437,215,429,427,853,95,189,187,373,183,365,363,725,175,349,347,693,343,685,683,1365

%N Triangle read by rows: T(n,k) = 2 * (k mod 2 + 1) * T(n-1,floor(k/2)) + 1 with T(0,0) = 1 for 0 <= k <= 2^n-1.

%H Seiichi Manyama, <a href="/A370762/b370762.txt">Rows n = 0..12, flattened</a>

%e First few rows are:

%e 1;

%e 3, 5;

%e 7, 13, 11, 21;

%e 15, 29, 27, 53, 23, 45, 43, 85;

%e 31, 61, 59, 117, 55, 109, 107, 213, 47, 93, 91, 181, 87, 173, 171, 341;

%o (PARI) T(n, k) = if(n==0, 1, 2*(k%2+1)*T(n-1, k\2)+1);

%Y Row sums give A016129.

%Y Columns k=0 gives A000225(n+1).

%Y Cf. A247648.

%K nonn,tabf

%O 0,2

%A _Seiichi Manyama_, Mar 01 2024