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 A266190 #10 Jan 09 2016 14:27:01
%S A266190 0,1,2,3,4,5,6,7,8,10,9,19,12,13,14,15,16,17,24,11,69,21,25,23,18,22,
%T A266190 26,31,28,73,30,27,46,33,55,58,37,36,64,39,40,41,42,43,44,51,32,150,
%U A266190 48,52,50,45,49,53,78,34,213,57,35,204,60,61,231,75,38,210,66,79,68,20,70,77,72,29,207,63,76,71,54,67,80,94,85,235
%N A266190 Self-inverse permutation of nonnegative integers: a(n) = A264985(A263273(A264985(n))).
%C A266190 A263273 conjugated with the permutation obtained from its odd bisection.
%H A266190 Antti Karttunen, <a href="/A266190/b266190.txt">Table of n, a(n) for n = 0..6561</a>
%H A266190 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A266190 a(n) = A264985(A263273(A264985(n))).
%F A266190 As a composition of related permutations:
%F A266190 a(n) = A265353(A264985(n)).
%F A266190 a(n) = A264985(A265354(n)).
%t A266190 f[n_] := Block[{g, h}, g[x_] := x/3^IntegerExponent[x, 3]; h[x_] := x/g@ x; If[n == 0, 0, FromDigits[Reverse@ IntegerDigits[#, 3], 3] &@ g[n] h[n]]]; s = Select[f /@ Range@ 5000, OddQ]; t = Table[(s[[n + 1]] - 1)/2, {n, 0, 1000}]; Table[t[[f[t[[n + 1]]] + 1]], {n, 0, 83}] (* _Michael De Vlieger_, Jan 04 2016, after _Jean-François Alcover_ at A263273 *)
%o A266190 (Scheme) (define (A266190 n) (A264985 (A263273 (A264985 n))))
%Y A266190 Cf. A263273, A264985, A265353, A265354.
%Y A266190 Cf. A265369, A265904, A266401, A266403 (other conjugates or similar derivations of A263273).
%Y A266190 Cf. also A266189.
%K A266190 nonn,base
%O A266190 0,3
%A A266190 _Antti Karttunen_, Jan 02 2016