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 A262692 #9 Oct 02 2015 12:23:17 %S A262692 1,2,3,4,5,9,6,12,7,16,8,25,14,18,10,32,19,20,11,45,26,24,13,66,38,42, %T A262692 22,49,29,28,15,81,53,50,31,52,33,30,17,121,73,68,39,64,37,40,21,175, %U A262692 106,104,61,114,69,56,35,135,82,76,46,75,43,44,23,231,129,147,86,136,83,80,51,144,85,88,55,78,47,48,27,338,197,190,118,182,108,105,62,172,101,102,60,110,65,54,34 %N A262692 Permutation of natural numbers: a(1) = 1; thereafter a(2n) = A182859(1+a(n)), a(2n+1) = A080218(a(n)). %C A262692 This sequence can be represented as a binary tree. For each node containing n, the left hand child is obtained as A182859(1+n), and the right hand child as A080218(n): %C A262692 1 %C A262692 | %C A262692 ................../ \.................. %C A262692 2 3 %C A262692 4......../ \........5 9......../ \........6 %C A262692 / \ / \ / \ / \ %C A262692 / \ / \ / \ / \ %C A262692 / \ / \ / \ / \ %C A262692 12 7 16 8 25 14 18 10 %C A262692 32 19 20 11 45 26 24 13 66 38 42 22 49 29 28 15 %C A262692 etc. %H A262692 Antti Karttunen, <a href="/A262692/b262692.txt">Table of n, a(n) for n = 1..4095</a> %H A262692 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A262692 a(1) = 1; thereafter a(2n) = A182859(1+a(n)), a(2n+1) = A080218(a(n)). %o A262692 (Scheme, with memoization-macro definec) %o A262692 (definec (A262692 n) (cond ((<= n 1) n) ((even? n) (A182859 (+ 1 (A262692 (/ n 2))))) (else (A080218 (A262692 (/ (- n 1) 2)))))) %Y A262692 Inverse: A262691. %Y A262692 Cf. A080218, A182859. %K A262692 nonn,tabf %O A262692 1,2 %A A262692 _Antti Karttunen_, Sep 28 2015