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 A266416 #11 Jan 12 2016 00:42:39 %S A266416 1,2,5,4,3,10,17,6,13,8,11,34,9,22,71,20,7,18,19,14,23,12,21,38,41,26, %T A266416 53,16,31,42,29,62,107,68,67,142,61,58,197,44,25,122,59,50,137,40,73, %U A266416 118,49,82,227,36,33,146,55,46,89,28,43,66,37,86,91,24,45,106,35,74,65,76,15,70,47,30,119,52 %N A266416 Permutation of natural numbers: a(n) = A064989(A263273(A250469(n))). %H A266416 Antti Karttunen, <a href="/A266416/b266416.txt">Table of n, a(n) for n = 1..6562</a> %H A266416 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A266416 a(n) = A064989(A263273(A250469(n))). %F A266416 As a composition of related permutations: %F A266416 a(n) = A266645(A266403(n)). %F A266416 a(n) = A064216(A264996(A250471(n))) = A064216(1+A264985(-1+A250471(n))). %F A266416 Other identities. For all n >= 0: %F A266416 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A266416 (Scheme) (define (A266416 n) (A064989 (A263273 (A250469 n)))) %Y A266416 Inverse: A266415. %Y A266416 Cf. A000035, A064989, A250469, A263273. %Y A266416 Related permutations: A064216, A250471, A264985, A264996, A266403, A266645. %K A266416 nonn,base %O A266416 1,2 %A A266416 _Antti Karttunen_, Jan 02 2016