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.

A329906 a(0) = 1; a(1) = 2; after which a(2n) = A329898(a(n)), a(2n+1) = A330683(a(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 11, 6, 9, 7, 23, 15, 38, 8, 20, 13, 22, 10, 44, 30, 110, 19, 69, 49, 128, 12, 41, 27, 72, 17, 43, 29, 54, 14, 79, 56, 272, 37, 181, 136, 482, 26, 118, 86, 307, 61, 208, 156, 424, 16, 73, 52, 190, 34, 123, 89, 242, 24, 77, 55, 147, 36, 93, 66, 114, 18, 131, 97, 596, 68, 416, 323, 1448, 48, 286, 218, 990, 164, 711
Offset: 0

Views

Author

Antti Karttunen, Dec 24 2019

Keywords

Comments

Note the indexing: domain begins from zero, but the range does not include it.

Examples

			This irregular table can be represented as a binary tree. Each child to the left is obtained by applying A329898 the parent, and each child to the right is obtained by applying A330683 to the parent:
                                      1
                                      |
                   ...................2...................
                  3                                       4
        5......../ \........11                  6......../ \........9
       / \                 / \                 / \                 / \
      /   \               /   \               /   \               /   \
     /     \             /     \             /     \             /     \
    7       23         15       38          8       20         13       22
  10 44   30  110    19  69    49 128     12 41   27  72     17  43   29  54
etc.
		

Crossrefs

Cf. A329905 (inverse permutation).

Programs

Formula

a(0) = 1; a(1) = 2; after which a(2n) = A329898(a(n)), a(2n+1) = A330683(a(n)).
a(n) = A329901(A163511(n)).