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 A324120 #12 Feb 19 2019 18:19:31
%S A324120 0,0,0,1,0,2,0,2,1,2,0,2,0,2,2,3,0,2,0,2,2,2,0,2,1,2,2,2,0,2,0,4,2,2,
%T A324120 2,3,0,2,2,4,0,2,0,2,2,2,0,2,1,2,2,2,0,2,2,4,2,2,0,4,0,2,2,5,2,2,0,2,
%U A324120 2,2,0,2,0,2,2,2,2,2,0,4,3,2,0,4,2,2,2,4,0,2,2,2,2,2,2,2,0,2,2,3,0,2,0,4,2
%N A324120 Binary weight of SumXOR variant of A297168: a(n) = A000120(A324180(n)).
%H A324120 Antti Karttunen, <a href="/A324120/b324120.txt">Table of n, a(n) for n = 1..65537</a>
%H A324120 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A324120 a(n) = A000120(A324180(n)).
%F A324120 a(n) <= A324190(n).
%F A324120 a(p^k) = k-1 for all primes p and exponents k >= 1.
%o A324120 (PARI)
%o A324120 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
%o A324120 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
%o A324120 A297112(n) = if(1==n, 0, 2^A297167(n));
%o A324120 A324180(n) = { my(v=0); fordiv(n, d, if(d<n, v = bitxor(v,A297112(d)))); (v); };
%o A324120 A324120(n) = hammingweight(A324180(n));
%Y A324120 Cf. A000043, A324179, A324180, A324181, A324190, A324191, A324192, A324201.
%K A324120 nonn
%O A324120 1,6
%A A324120 _Antti Karttunen_, Feb 19 2019