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 A302784 #9 Sep 27 2023 02:45:04 %S A302784 0,1,3,6,12,2,24,7,48,13,96,5,192,25,15,384,768,49,1536,10,27,97,3072, %T A302784 4,6144,193,51,30,12288,14,24576,385,99,769,20,54,49152,1537,195,11, %U A302784 98304,26,196608,102,60,3073,393216,387,786432,6145,771,198,1572864,50,108,31,1539,12289,3145728,9,6291456,24577,40,390,204,98,12582912,774,3075,21 %N A302784 Inverse permutation to A302783: a(n) = A003188(A052331(n)). %H A302784 Antti Karttunen, <a href="/A302784/b302784.txt">Table of n, a(n) for n = 1..4096</a> %H A302784 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A302784 a(n) = A003188(A052331(n)). %o A302784 (PARI) %o A302784 up_to = 4096; %o A302784 v050376 = vector(up_to); %o A302784 ispow2(n) = (n && !bitand(n,n-1)); %o A302784 i = 0; for(n=1,oo,if(ispow2(isprimepower(n)), i++; v050376[i] = n); if(i == up_to,break)); %o A302784 A052331(n) = { my(s=0,e); while(n > 1, fordiv(n, d, if(((n/d)>1)&&ispow2(isprimepower(n/d)), e = vecsearch(v050376, n/d); if(!e, print("v050376 too short!"); return(1/0)); s += 2^(e-1); n = d; break))); (s); }; %o A302784 A003188(n) = bitxor(n, n>>1); %o A302784 A302784(n) = A003188(A052331(n)); %Y A302784 Cf. A302783 (inverse). %Y A302784 Cf. also A302029. %K A302784 nonn %O A302784 1,3 %A A302784 _Antti Karttunen_, Apr 16 2018