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.

A341231 Irregular triangle read by rows giving trajectory from n to reach 1 under the map A245471.

Original entry on oeis.org

1, 2, 1, 3, 4, 2, 1, 4, 2, 1, 5, 14, 7, 8, 4, 2, 1, 6, 3, 4, 2, 1, 7, 8, 4, 2, 1, 8, 4, 2, 1, 9, 26, 13, 22, 11, 28, 14, 7, 8, 4, 2, 1, 10, 5, 14, 7, 8, 4, 2, 1, 11, 28, 14, 7, 8, 4, 2, 1, 12, 6, 3, 4, 2, 1, 13, 22, 11, 28, 14, 7, 8, 4, 2, 1, 14, 7, 8, 4, 2, 1
Offset: 1

Views

Author

Rémy Sigrist, Feb 07 2021

Keywords

Comments

A340873 gives row lengths.
A341235 gives greatest terms.

Examples

			Table begins:
    1;
    2, 1;
    3, 4, 2, 1;
    4, 2, 1;
    5, 14, 7, 8, 4, 2, 1;
    6, 3, 4, 2, 1;
    7, 8, 4, 2, 1;
    8, 4, 2, 1;
    9, 26, 13, 22, 11, 28, 14, 7, 8, 4, 2, 1;
    10, 5, 14, 7, 8, 4, 2, 1;
    11, 28, 14, 7, 8, 4, 2, 1;
    12, 6, 3, 4, 2, 1;
    13, 22, 11, 28, 14, 7, 8, 4, 2, 1;
    14, 7, 8, 4, 2, 1;
    15, 16, 8, 4, 2, 1;
    16, 8, 4, 2, 1;
    ...
		

Crossrefs

Programs

  • PARI
    row(n) = { my (r=[n]); while (n>1, r=concat(r, n=if (n%2, bitxor(n, 2*n+1), n/2))); r }

Formula

T(n, 1) = n.
T(n, A340873(n)) = 1.