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 A246206 #12 Aug 21 2014 00:00:45 %S A246206 1,2,5,9,4,13,3,37,49,64,6,10,16,81,8,20,15,351,229,451,59,11,7,41,19, %T A246206 73,92,114,27,36,48,140,12,53,17,24,33,69,86,107,44,170,18,63,22,410, %U A246206 28,524,76,271,101,14,23,687,529,895,253,25,97,213,145,333,3413,67,2091,31,607,103,415,4531,47,131,87,193,55 %N A246206 Permutation of natural numbers: a(1) = 1, if A117966(n) < 0, a(n) = A014580(a(-(A117966(n)))), otherwise a(n) = A091242(a(A117966(n)-1)). %C A246206 Compare to the formula for A246164. However, instead of reversing binary representation, we employ here balanced ternary enumeration of integers (see A117966). %H A246206 Antti Karttunen, <a href="/A246206/b246206.txt">Table of n, a(n) for n = 1..231</a> %H A246206 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %H A246206 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A246206 a(1) = 1, and for n > 1, if A117966(n) < 0, then a(n) = A014580(a(-(A117966(n)))), otherwise a(n) = A091242(a(A117966(n)-1)). %F A246206 As a composition of related permutations: %F A246206 a(n) = A245702(A246208(n)). %F A246206 a(n) = A246202(A246210(n)). %o A246206 (Scheme, with memoization-macro definec) %o A246206 (definec (A246206 n) (cond ((= 1 n) n) ((negative? (A117966 n)) (A014580 (A246206 (- (A117966 n))))) (else (A091242 (A246206 (- (A117966 n) 1)))))) %Y A246206 Inverse: A246205. %Y A246206 Similar or related entanglement permutations: A246164, A245702, A246202, A246208, A246210. %Y A246206 Cf. A014580, A091242, A117966. %K A246206 nonn %O A246206 1,2 %A A246206 _Antti Karttunen_, Aug 19 2014