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 A264966 #14 May 23 2017 20:59:31 %S A264966 0,1,2,3,4,7,6,5,8,9,10,25,12,11,26,21,16,19,18,13,20,15,14,29,24,17, %T A264966 22,27,28,59,30,41,64,39,58,73,36,31,46,57,40,97,66,35,100,63,34,47, %U A264966 48,53,98,105,44,121,54,23,56,33,50,65,60,61,82,45,32,55,42,37,68,81,38,89,72,49,62,51,52,113,114,43,80,69 %N A264966 Permutation of nonnegative integers: a(n) = A057889(A263273(n)). %C A264966 Perform an adjusted reverse of n in base 3, followed by another adjusted reverse in base 2. "Adjusted reverse" here means a digit-reversing operation where the suffix of trailing zeros (in the base in question) stays as it is at the right side, and only the section from the most significant digit to the least significant nonzero digit is reversed. %H A264966 Antti Karttunen, <a href="/A264966/b264966.txt">Table of n, a(n) for n = 0..10000</a> %H A264966 Indranil Ghosh, <a href="/A264966/a264966.txt">Python program to generate the sequence</a> %H A264966 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A264966 a(n) = A057889(A263273(n)). %F A264966 Other identities. For all n >= 0: %F A264966 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A264966 (Scheme) (define (A264966 n) (A057889 (A263273 n))) %Y A264966 Inverse: A264965. %Y A264966 Cf. A000035, A057889, A263273. %Y A264966 Cf. also A264967, A264968. %K A264966 nonn,base %O A264966 0,3 %A A264966 _Antti Karttunen_, Dec 05 2015