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 A302793 #10 Dec 23 2024 14:53:45
%S A302793 0,1,3,5,2,6,4,7,15,17,8,11,9,13,10,12,14,18,16,19,20,21,23,30,22,25,
%T A302793 51,24,26,27,28,31,29,39,32,35,33,37,45,36,38,41,43,85,42,46,44,47,40,
%U A302793 49,54,48,50,60,52,55,53,58,56,59,34,61,63,57,62,66,64,67,75,69,71,65,70,73,78,72,74,102,76,79,77,81
%N A302793 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = A193231(1+A193231(n-1)), where A193231(n) is blue code of n.
%H A302793 Antti Karttunen, <a href="/A302793/b302793.txt">Table of n, a(n) for n = 0..16383</a>
%H A302793 David Newman, et al., <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2018-January/018239.html">New sequences from old, Discussion on SeqFan-mailing list</a>, January 2018.
%H A302793 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A302793 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A302793 a(0) = 0; for n >= 1, a(n) = A193231(1+A193231(n-1)).
%o A302793 (PARI)
%o A302793 A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) }; \\ From A193231
%o A302793 A302793(n) = if(!n,n,A193231(1+A193231(n-1)));
%Y A302793 Cf. A302794 (inverse).
%Y A302793 Cf. A193231, A302795.
%Y A302793 Cf. also A268717, A302027.
%K A302793 nonn,base
%O A302793 0,3
%A A302793 _Antti Karttunen_, Apr 26 2018