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 A264979 #18 May 24 2021 00:17:54
%S A264979 0,1,2,3,4,5,6,7,8,9,10,19,28,37,46,55,64,73,18,11,20,29,38,47,56,65,
%T A264979 74,27,12,21,30,39,48,57,66,75,36,13,22,31,40,49,58,67,76,45,14,23,32,
%U A264979 41,50,59,68,77,54,15,24,33,42,51,60,69,78,63,16,25,34,43,52,61,70,79,72,17,26,35,44,53,62,71,80,81
%N A264979 Bijective base-9 reverse: a(0) = 0; for n >= 1, a(n) = A030108(n/A264981(n)) * A264981(n).
%C A264979 Self-inverse permutation of nonnegative integers.
%C A264979 It appears that a(m x) == 0 (mod m) for m = 2^k and m = 5*2^k, k >= 0, but not for other m. Is there a simple explanation? - _M. F. Hasler_, May 21 2021
%H A264979 Antti Karttunen, <a href="/A264979/b264979.txt">Table of n, a(n) for n = 0..6561</a>
%H A264979 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A264979 a(0) = 0; for n >= 1, a(n) = A030108(n/A264981(n)) * A264981(n).
%o A264979 (Scheme)
%o A264979 (define (A264979 n) (if (zero? n) n (* (A030108 (/ n (A264981 n))) (A264981 n))))
%o A264979 (PARI) apply( {A264979(n)=A030108(n/n=9^valuation(n+!n,9))*n}, [0..99]) \\ _M. F. Hasler_, May 21 2021
%Y A264979 Cf. A030108, A264981.
%Y A264979 Cf. A265338 (a(8n)/8).
%Y A264979 Cf. A057889 (base-2), A263273 (base-3), A264994 (base-4), A264995 (base-5).
%K A264979 nonn,base
%O A264979 0,3
%A A264979 _Antti Karttunen_, Dec 07 2015