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.
%I A267106 #9 Feb 03 2016 17:02:34 %S A267106 1,2,3,4,6,5,7,8,10,11,13,9,12,14,16,15,18,19,24,20,25,23,29,17,21,22, %T A267106 26,27,30,31,35,28,33,34,40,36,42,46,53,38,44,47,55,43,51,54,62,32,37, %U A267106 39,45,41,50,48,57,49,59,56,65,58,66,67,74,52,60,63,70,64,71,76,82,69,77,83,87,91,98,101,112,73,79 %N A267106 Permutation of natural numbers: a(1) = 1, a(2n) = A080148(a(n)), a(2n+1) = A080147(a(n)). %C A267106 This sequence can be represented as a binary tree. Each left hand child is produced as A080148(n), and each right hand child as A080147(n), when the parent node contains n: %C A267106 | %C A267106 ...................1................... %C A267106 2 3 %C A267106 4......../ \........6 5......../ \........7 %C A267106 / \ / \ / \ / \ %C A267106 / \ / \ / \ / \ %C A267106 / \ / \ / \ / \ %C A267106 8 10 11 13 9 12 14 16 %C A267106 15 18 19 24 20 25 23 29 17 21 22 26 27 30 31 35 %C A267106 etc. %H A267106 Antti Karttunen, <a href="/A267106/b267106.txt">Table of n, a(n) for n = 1..16383</a> %H A267106 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A267106 a(1) = 1, after which, a(2n) = A080148(a(n)), a(2n+1) = A080147(a(n)). %o A267106 (Scheme, with memoization-macro definec) %o A267106 (definec (A267106 n) (cond ((<= n 1) n) ((odd? n) (A080147 (A267106 (/ (- n 1) 2)))) (else (A080148 (A267106 (/ n 2)))))) %Y A267106 Inverse: A267105. %Y A267106 Cf. A000040, A002144, A002145, A080147, A080148. %Y A267106 Cf. also A267107. %K A267106 nonn,tabf %O A267106 1,2 %A A267106 _Antti Karttunen_, Feb 01 2016