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 A379472 #9 Dec 25 2024 10:54:52
%S A379472 0,1,3,2,5,4,6,7,15,14,12,11,10,13,9,8,17,16,18,25,20,21,29,26,30,31,
%T A379472 23,28,27,22,24,19,51,38,48,35,54,59,43,44,60,47,63,62,39,56,46,55,34,
%U A379472 49,33,32,57,50,36,41,45,52,58,61,40,37,53,42,85,84,106,117,80,69,101,74,90,109,77,104,125,122,116,93
%N A379472 Composition of Blue code and bijective bit-reverse, in this order: a(n) = A057889(A193231(n)).
%H A379472 Antti Karttunen, <a href="/A379472/b379472.txt">Table of n, a(n) for n = 0..16383</a>
%H A379472 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A379472 <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>
%H A379472 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o A379472 (PARI)
%o A379472 A030101(n) = if(n<1,0,subst(Polrev(binary(n)),x,2));
%o A379472 A057889(n) = if(!n,n,A030101(n/(2^valuation(n,2))) * (2^valuation(n, 2)));
%o A379472 A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) };
%o A379472 A379472(n) = A057889(A193231(n));
%Y A379472 Cf. A057889, A193231, A379471 (inverse permutation).
%K A379472 nonn,easy,base
%O A379472 0,3
%A A379472 _Antti Karttunen_, Dec 25 2024