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 A266415 #11 Jan 09 2016 16:08:29 %S A266415 1,2,5,4,3,8,17,10,13,6,11,22,9,20,71,28,7,18,19,16,23,14,21,64,41,26, %T A266415 227,58,31,74,29,82,53,12,67,52,61,24,107,46,25,30,59,40,65,56,73,190, %U A266415 49,44,197,76,27,230,55,172,137,38,43,220,37,32,571,244,69,60,35,34,89,72,15,154,47,68,479,70 %N A266415 Permutation of natural numbers: a(n) = A250470(A263273(A003961(n))). %H A266415 Antti Karttunen, <a href="/A266415/b266415.txt">Table of n, a(n) for n = 1..767</a> %H A266415 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A266415 a(n) = A250470(A263273(A003961(n))). %F A266415 As a composition of related permutations: %F A266415 a(n) = A266403(A266646(n)). %F A266415 a(n) = A250472(A264996(A048673(n))) = A250472(1+A264985(-1+A048673(n))). %F A266415 Other identities. For all n >= 0: %F A266415 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A266415 (Scheme) (define (A266415 n) (A250470 (A263273 (A003961 n)))) %Y A266415 Inverse: A266416. %Y A266415 Cf. A000035, A003961, A250470, A263273. %Y A266415 Related permutations: A048673, A250472, A264985, A264996, A266403, A266646. %K A266415 nonn,base %O A266415 1,2 %A A266415 _Antti Karttunen_, Jan 02 2016