login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A183210
Tree generated by 3n-2.
0
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,2
COMMENTS
A permutation of the positive integers. See A183079 and A183209. Leftmost branch: A034472. Rightmost branch: A061419.
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.
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 30 2010
STATUS
approved