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 A324052 #12 Feb 19 2019 00:09:24 %S A324052 1,0,1,0,3,-2,3,0,5,-2,1,-4,15,-6,9,0,9,-2,3,-4,13,-14,3,-8,35,-10,5, %T A324052 -12,75,-18,27,0,11,-2,7,-4,25,-18,9,-8,43,-22,-9,-28,65,-42,9,-16,99, %U A324052 -14,21,-20,91,-70,15,-24,245,-50,25,-36,375,-54,81,0,15,-2,9,-4,31,-26,21,-8,53,-30,-5,-36,125,-54,27,-16,97,-34,9 %N A324052 a(n) = A083254(A005940(1+n)). %H A324052 Antti Karttunen, <a href="/A324052/b324052.txt">Table of n, a(n) for n = 0..8191</a> %H A324052 Antti Karttunen, <a href="/A324052/a324052.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %F A324052 a(n) = A083254(A005940(1+n)). %F A324052 a(n) = 2*A290077(n) - A005940(1+n). %F A324052 For n >= 1, a(n) = A324182(A054429(n)). %F A324052 For n >= 1, a((2^n)-1) = 0. %o A324052 (PARI) A324052(n) = { my(m1=1,m2=2,p=2); while(n, if(!(n%2), p=nextprime(1+p), m1 *= p; m2 *= (p-(1==(n%4)))); n>>=1); (m2-m1); }; %o A324052 (PARI) %o A324052 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940 %o A324052 A083254(n) = (2*eulerphi(n)-n); %o A324052 A324052(n) = A083254(A005940(1+n)); %Y A324052 Cf. A005940, A083254, A054429, A290077, A324055, A324182. %Y A324052 Cf. also A324103. %K A324052 sign %O A324052 0,5 %A A324052 _Antti Karttunen_, Feb 18 2019