cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A370762 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.

This page as a plain text file.
%I A370762 #14 Mar 02 2024 00:03:00
%S A370762 1,3,5,7,13,11,21,15,29,27,53,23,45,43,85,31,61,59,117,55,109,107,213,
%T A370762 47,93,91,181,87,173,171,341,63,125,123,245,119,237,235,469,111,221,
%U A370762 219,437,215,429,427,853,95,189,187,373,183,365,363,725,175,349,347,693,343,685,683,1365
%N A370762 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 A370762 Seiichi Manyama, <a href="/A370762/b370762.txt">Rows n = 0..12, flattened</a>
%e A370762 First few rows are:
%e A370762    1;
%e A370762    3,  5;
%e A370762    7, 13, 11,  21;
%e A370762   15, 29, 27,  53, 23,  45,  43,  85;
%e A370762   31, 61, 59, 117, 55, 109, 107, 213, 47, 93, 91, 181, 87, 173, 171, 341;
%o A370762 (PARI) T(n, k) = if(n==0, 1, 2*(k%2+1)*T(n-1, k\2)+1);
%Y A370762 Row sums give A016129.
%Y A370762 Columns k=0 gives A000225(n+1).
%Y A370762 Cf. A247648.
%K A370762 nonn,tabf
%O A370762 0,2
%A A370762 _Seiichi Manyama_, Mar 01 2024