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 A266646 #10 Jan 09 2016 16:09:27 %S A266646 1,2,3,4,5,6,7,10,9,8,11,16,13,12,15,28,17,26,19,22,21,14,23,46,25,18, %T A266646 51,34,29,36,31,82,27,20,35,76,37,24,33,64,41,56,43,40,69,30,47,136, %U A266646 49,50,39,52,53,126,55,100,45,32,59,106,61,38,111,244,65,66,67,58,57,78,71,226,73,42,99,70,77,86,79,190,249,44,83,166,85 %N A266646 Permutation of natural numbers: a(n) = A250470(A003961(n)). %H A266646 Antti Karttunen, <a href="/A266646/b266646.txt">Table of n, a(n) for n = 1..767</a> %H A266646 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A266646 a(n) = A250470(A003961(n)). %F A266646 As a composition of related permutations: %F A266646 a(n) = A266403(A266415(n)). %F A266646 Other identities. For all n >= 0: %F A266646 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %F A266646 A020639(a(n)) = A020639(n). [More generally, it preserves the smallest prime dividing n.] %F A266646 A055396(a(n)) = A055396(n). %o A266646 (Scheme) (define (A266646 n) (A250470 (A003961 n))) %Y A266646 Inverse: A266645. %Y A266646 Cf. A000035, A020639, A055396, A003961, A250470. %Y A266646 Related permutations: A249817, A249818, A266403, A266415. %K A266646 nonn %O A266646 1,2 %A A266646 _Antti Karttunen_, Jan 02 2016