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 A319273 #8 Oct 05 2018 11:21:40
%S A319273 1,1,1,2,1,0,1,3,2,0,1,1,1,0,0,4,1,-1,1,1,0,0,1,2,2,0,3,1,1,1,1,5,0,0,
%T A319273 0,0,1,0,0,2,1,1,1,1,1,0,1,3,2,-1,0,1,1,-2,0,2,0,0,1,2,1,0,1,6,0,1,1,
%U A319273 1,0,1,1,1,1,0,-1,1,0,1,1,3,4,0,1,2,0,0,0,2,1,0,0,1,0,0,0,4,1,-1,1,0,1,1,1,2,1
%N A319273 Signed sum over the prime multiplicities of n.
%C A319273 If n = Product prime(x_i)^y_i is the prime factorization of n, then a(n) = Sum (-1)^(i-1) y_i.
%H A319273 Antti Karttunen, <a href="/A319273/b319273.txt">Table of n, a(n) for n = 1..65537</a>
%e A319273 The prime factorization of 810 is 2^1 * 3^4 * 5^1, so a(810) = 1 - 4 + 1 = -2.
%t A319273 Table[Total[MapIndexed[(-1)^(#2[[1]]-1)*#1&,Last/@FactorInteger[n]]],{n,100}]
%o A319273 (PARI) A319273(n) = if(1==n, n, my(f=factor(n)); sum(i=1, #f~, f[i,2] * ((-1)^(i-1)))); \\ _Antti Karttunen_, Sep 30 2018
%Y A319273 Cf. A000040, A001221, A001222, A008683, A071321, A195017, A268387, A316523, A316524.
%K A319273 sign
%O A319273 1,4
%A A319273 _Gus Wiseman_, Sep 16 2018
%E A319273 More terms from _Antti Karttunen_, Sep 30 2018