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 A277696 #8 Nov 07 2016 09:10:31 %S A277696 1,2,5,3,10,7,13,4,39,15,26,9,11,18,29,6,20,92,75,24,27,49,58,14,21, %T A277696 16,19,31,42,62,41,8,78,33,52,270,172,196,147,47,312,56,51,126,101, %U A277696 143,82,23,22,34,45,28,80,32,35,64,59,96,90,153,118,95,61,12,40,224,150,66,57,129,116,1134,534,606,316,752,404,520,207,120,55,1400,600 %N A277696 Permutation of natural numbers: a(1) = 1; a(2n) = A277817(1+a(n)), a(2n+1) = A277816(a(n)). %C A277696 This sequence can be represented as a binary tree. Each left hand child is produced as A277817(1+n), and each right hand child as A277816(n), when the parent node contains n: %C A277696 1 %C A277696 ................../ \.................. %C A277696 2 5 %C A277696 3......../ \........10 7......../ \........13 %C A277696 / \ / \ / \ / \ %C A277696 / \ / \ / \ / \ %C A277696 / \ / \ / \ / \ %C A277696 4 39 15 26 9 11 18 29 %C A277696 6 20 92 75 24 27 49 58 14 21 16 19 31 42 62 41 %C A277696 etc. %H A277696 Antti Karttunen, <a href="/A277696/b277696.txt">Table of n, a(n) for n = 1..1024</a> %H A277696 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A277696 a(1) = 1; and then after, a(2n) = A277817(1+a(n)), a(2n+1) = A277816(a(n)). %o A277696 (Scheme, with memoization-macro definec) %o A277696 (definec (A277696 n) (cond ((= 1 n) n) ((even? n) (A277817 (+ 1 (A277696 (/ n 2))))) (else (A277816 (A277696 (/ (- n 1) 2)))))) %Y A277696 Inverse: A277695. %Y A277696 Cf. A277710, A277816, A277817. %Y A277696 Cf. A277701 (the rightmost edge of the tree). %K A277696 nonn,tabf %O A277696 1,2 %A A277696 _Antti Karttunen_, Nov 06 2016