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 A264965 #26 May 23 2017 20:59:24 %S A264965 0,1,2,3,4,7,6,5,8,9,10,13,12,19,22,21,16,25,18,17,20,15,26,55,24,11, %T A264965 14,27,28,23,30,37,64,57,46,43,36,67,70,33,40,31,66,79,52,63,38,47,48, %U A264965 73,58,75,76,49,54,65,56,39,34,29,60,61,74,45,32,59,42,145,68,81,226,193,72,35,82,219,100,217,174,121,80,69 %N A264965 Permutation of nonnegative integers: a(n) = A263273(A057889(n)). %C A264965 Perform an adjusted reverse of n in base 2, followed by another adjusted reverse in base 3. "Adjusted reverse" here means the digit-reversing operation in which the tail of trailing zeros (in the base in question) is fixed, while the portion from the most significant digit to the least significant nonzero digit is reversed. %C A264965 What percentage of the cycles are finite? (See the scatter-plot and A264969, also A264972, A264973.) %H A264965 Antti Karttunen, <a href="/A264965/b264965.txt">Table of n, a(n) for n = 0..10000</a> %H A264965 Indranil Ghosh, <a href="/A264965/a264965.txt">Python program to generate the sequence</a> %F A264965 a(n) = A263273(A057889(n)). %F A264965 Other identities. For all n >= 0: %F A264965 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A264965 (Scheme) (define (A264965 n) (A263273 (A057889 n))) %Y A264965 Inverse: A264966. %Y A264965 Cf. A000035, A057889, A263273, A264969, A264972, A264973. %Y A264965 Cf. also A264967, A264968. %K A264965 nonn,base,look %O A264965 0,3 %A A264965 _Antti Karttunen_, Dec 05 2015