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 A266408 #6 Jan 09 2016 16:09:07
%S A266408 1,2,4,5,3,11,10,14,9,8,7,32,13,29,37,41,6,26,12,23,15,20,28,95,22,38,
%T A266408 115,86,19,110,16,122,30,17,36,77,34,35,55,68,25,44,31,59,60,83,40,
%U A266408 284,61,65,100,113,33,344,46,257,70,56,24,329,21,47,289,365,88,89,39,50,49,107,18,230,27,101,244,104,112,164,82,203,174,74
%N A266408 Permutation of natural numbers: a(n) = (1/2) * (1+A263273(A003961(n))).
%H A266408 Antti Karttunen, <a href="/A266408/b266408.txt">Table of n, a(n) for n = 1..8191</a>
%H A266408 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A266408 a(n) = (1/2) * (1+A263273(A003961(n))).
%o A266408 (PARI)
%o A266408 A030102(n) = { my(r=[n%3]); while(0<n\=3, r=concat(n%3, r)); subst(Polrev(r),x,3); } \\ After _M. F. Hasler_'s Nov 04 2011 code in A030102.
%o A266408 A263273 = n -> if(!n,n,A030102(n/(3^valuation(n,3))) * (3^valuation(n, 3))); \\ Taking of the quotient probably unnecessary.
%o A266408 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of _Michel Marcus_
%o A266408 A266408 = n -> (1+A263273(A003961(n)))/2;
%o A266408 for(n=1, 8191, write("b266408.txt", n, " ", A266408(n)));
%o A266408 (Scheme) (define (A266408 n) (/ (+ 1 (A263273 (A003961 n))) 2))
%Y A266408 Inverse: A266407.
%Y A266408 Cf. A003961, A263273.
%Y A266408 Cf. also A048673, A266401, A266403.
%K A266408 nonn,base
%O A266408 1,2
%A A266408 _Antti Karttunen_, Jan 02 2016