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 A324194 #7 Feb 19 2019 18:20:33 %S A324194 -1,0,1,-1,2,1,2,-1,3,1,6,0,5,1,2,-2,4,6,10,0,11,8,6,1,8,7,10,3,5,3,2, %T A324194 -2,5,6,18,7,19,15,12,1,16,18,24,6,12,8,8,-1,11,15,22,6,19,14,12,3,8, %U A324194 5,12,1,6,4,2,-2,6,12,24,11,30,27,24,8,28,34,44,17,24,19,14,3,21,29,44,22,40,27,24,9,18,18,24,10,15,7,8,0,14,21 %N A324194 A000120-deficiency of n permuted by A163511: a(n) = A192895(A163511(n)). %H A324194 Antti Karttunen, <a href="/A324194/b324194.txt">Table of n, a(n) for n = 0..16384</a> %H A324194 Antti Karttunen, <a href="/A324194/a324194.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %H A324194 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A324194 a(n) = A192895(A163511(n)). %F A324194 For n > 0, a(n) = A324114(A054429(n)). %o A324194 (PARI) %o A324194 A163511(n) = if(!n,1,my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p)); %o A324194 A192895(n) = sumdiv(n, d, hammingweight(d)*(-1)^(d==n)); %o A324194 A324194(n) = A192895(A163511(n)); %Y A324194 Cf. A054429, A163511, A192895, A324114. %Y A324194 Cf. also A324100, A324185. %K A324194 sign %O A324194 0,5 %A A324194 _Antti Karttunen_, Feb 19 2019