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.

A183210 Tree generated by 3n-2.

Original entry on oeis.org

1, 2, 4, 3, 10, 6, 7, 5, 28, 15, 16, 9, 19, 11, 13, 8, 82, 42, 43, 23, 46, 24, 25, 14, 55, 29, 31, 17, 37, 20, 22, 12, 244, 123, 124, 63, 127, 65, 67, 35, 136, 69, 70, 36, 73, 38, 40, 21, 163, 83, 85, 44, 91, 47, 49, 26, 109, 56, 58, 30, 64, 33, 34, 18, 730
Offset: 1

Views

Author

Clark Kimberling, Dec 30 2010

Keywords

Comments

A permutation of the positive integers. See A183079 and A183209. Leftmost branch: A034472. Rightmost branch: A061419.

Crossrefs

Formula

Let L(n)=3n-2.
Let U(n)=A007494(n); U is the complement of L.
The tree-array T(n,k) is then given by rows:
T(0,0)=1; T(1,0)=2;
T(n,2j)=L(T(n-1),j);
T(n,2j+1)=U(T(n-1),j);
for j=0,1,...,2^(n-1)-1, n>=2.