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 A234025 #12 Jun 05 2017 17:36:32 %S A234025 0,1,2,3,6,7,5,4,8,9,11,10,13,12,14,15,30,31,29,28,27,26,24,25,17,16, %T A234025 18,19,20,21,23,22,44,45,47,46,41,40,42,43,35,34,32,33,38,39,37,36,61, %U A234025 60,62,63,56,57,59,58,50,51,49,48,55,54,52,53,106,107,105 %N A234025 Permutation of nonnegative integers: a(n) = A054429(A193231(n)). %H A234025 Antti Karttunen, <a href="/A234025/b234025.txt">Table of n, a(n) for n = 0..8191</a> %H A234025 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A234025 a(n) = A054429(A193231(n)). %F A234025 a(n) = A234027(A054429(n)). %o A234025 (Scheme) (define (A234025 n) (A054429 (A193231 n))) %o A234025 (Python) %o A234025 def a065621(n): return n^(2*(n - (n&-n))) %o A234025 def a048724(n): return n^(2*n) %o A234025 def a054429(n): return 1 if n==1 else 2*a054429(int(n/2)) + 1 - n%2 %o A234025 def a193231(n): %o A234025 if n<2: return n %o A234025 if n%2==0: return a048724(a193231(n/2)) %o A234025 else: return a065621(1 + a193231((n - 1)/2)) %o A234025 def a(n): return n if n<2 else a054429(a193231(n)) # _Indranil Ghosh_, Jun 05 2017 %Y A234025 Inverse permutation: A234026. %K A234025 nonn %O A234025 0,3 %A A234025 _Antti Karttunen_, Dec 28 2013