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 A264995 #13 Dec 13 2015 07:50:04 %S A264995 0,1,2,3,4,5,6,11,16,21,10,7,12,17,22,15,8,13,18,23,20,9,14,19,24,25, %T A264995 26,51,76,101,30,31,56,81,106,55,36,61,86,111,80,41,66,91,116,105,46, %U A264995 71,96,121,50,27,52,77,102,35,32,57,82,107,60,37,62,87,112,85,42,67,92,117,110,47,72,97,122,75,28,53,78,103,40,33 %N A264995 Bijective base-5 reverse: a(0) = 0; for n >= 1, a(n) = A030104(A132739(n)) * A060904(n). %C A264995 Self-inverse permutation of nonnegative integers. %H A264995 Antti Karttunen, <a href="/A264995/b264995.txt">Table of n, a(n) for n = 0..15625</a> %H A264995 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A264995 a(0) = 0; for n >= 1, a(n) = A030104(A132739(n)) * A060904(n). %F A264995 Other identities. For all n >= 0: %F A264995 a(5*n) = 5*a(n). %F A264995 A010873(a(n)) = 0 if and only if A010873(n) = 0 and it also seems that A010873(a(n)) = A010873(n) for all n. %o A264995 (Scheme) %o A264995 (define (A264995 n) (if (zero? n) n (* (A030104 (A132739 n)) (A060904 n)))) %Y A264995 Cf. A010873, A030104, A060904, A132739. %Y A264995 Cf. similar sequences A057889 (base-2), A263273 (base-3), A264994 (base-4), A264979 (base-9). %K A264995 nonn,base %O A264995 0,3 %A A264995 _Antti Karttunen_, Dec 07 2015