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.

A341220 Irregular table read by rows T(n, k), n >= 0, k = 1..A341218(n); T(n, k) is the k-th number m such that A340873(m) = n.

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 7, 16, 12, 14, 15, 32, 5, 24, 28, 30, 31, 64, 10, 11, 48, 56, 60, 62, 63, 128, 20, 21, 22, 23, 96, 112, 120, 124, 126, 127, 256, 13, 40, 42, 43, 44, 46, 47, 192, 224, 240, 248, 252, 254, 255, 512, 25, 26, 27, 80, 84, 85, 86, 87, 88, 92, 94, 95, 384, 448, 480, 496, 504, 508, 510, 511, 1024
Offset: 0

Views

Author

Rémy Sigrist, Feb 07 2021

Keywords

Comments

Each positive integer appears once.
For any n >= 0:
- if m appears in row n, then 2*m appears in row n+1,
- if m appears in row n and is an odious even number > 2, then an additional odd number appears in row n+1.

Examples

			Table begins:
    1;
    2;
    4;
    3, 8;
    6, 7, 16;
    12, 14, 15, 32;
    5, 24, 28, 30, 31, 64;
    10, 11, 48, 56, 60, 62, 63, 128;
    20, 21, 22, 23, 96, 112, 120, 124, 126, 127, 256;
    13, 40, 42, 43, 44, 46, 47, 192, 224, 240, 248, 252, 254, 255, 512;
    ...
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

T(n, 1) = A341194(n).
T(n, A341218(n)) = 2^n.