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.

Original entry on oeis.org

1, 3, 5, 7, 13, 11, 21, 15, 29, 27, 53, 23, 45, 43, 85, 31, 61, 59, 117, 55, 109, 107, 213, 47, 93, 91, 181, 87, 173, 171, 341, 63, 125, 123, 245, 119, 237, 235, 469, 111, 221, 219, 437, 215, 429, 427, 853, 95, 189, 187, 373, 183, 365, 363, 725, 175, 349, 347, 693, 343, 685, 683, 1365
Offset: 0

Views

Author

Seiichi Manyama, Mar 01 2024

Keywords

Examples

			First few rows are:
   1;
   3,  5;
   7, 13, 11,  21;
  15, 29, 27,  53, 23,  45,  43,  85;
  31, 61, 59, 117, 55, 109, 107, 213, 47, 93, 91, 181, 87, 173, 171, 341;
		

Crossrefs

Row sums give A016129.
Columns k=0 gives A000225(n+1).
Cf. A247648.

Programs

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