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 A324182 #14 Oct 24 2023 12:21:15 %S A324182 1,0,0,1,0,3,-2,3,0,9,-6,15,-4,1,-2,5,0,27,-18,75,-12,5,-10,35,-8,3, %T A324182 -14,13,-4,3,-2,9,0,81,-54,375,-36,25,-50,245,-24,15,-70,91,-20,21, %U A324182 -14,99,-16,9,-42,65,-28,-9,-22,43,-8,9,-18,25,-4,7,-2,11,0,243,-162,1875,-108,125,-250,1715,-72,75,-350,637,-100,147,-98,1089 %N A324182 a(n) = A083254(A163511(n)), where A083254(n) = 2*phi(n) - n, the Möbius transform of the deficiency of n. %H A324182 Antti Karttunen, <a href="/A324182/b324182.txt">Table of n, a(n) for n = 0..16384</a> %H A324182 Antti Karttunen, <a href="/A324182/a324182.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %F A324182 a(n) = A083254(A163511(n)). %F A324182 For n > 0, a(n) = A324052(A054429(n)). %o A324182 (PARI) %o A324182 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 A324182 A083254(n) = (2*eulerphi(n)-n); %o A324182 A324182(n) = A083254(A163511(n)); %Y A324182 Cf. A054429, A083254, A163511, A324052, A324183, A324184, A324185 (compare the scatter plot), A366804 (rgs-transform). %Y A324182 Cf. also A324103. %K A324182 sign,look %O A324182 0,6 %A A324182 _Antti Karttunen_, Feb 18 2019