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 A325122 #7 Mar 30 2019 08:36:56
%S A325122 0,0,0,0,1,0,0,0,0,1,1,0,1,0,1,0,2,0,0,1,0,1,1,0,2,1,0,0,1,1,2,0,1,2,
%T A325122 1,0,1,0,1,1,2,0,2,1,1,1,3,0,0,2,2,1,0,0,2,0,0,1,1,1,1,2,0,0,2,1,2,2,
%U A325122 1,1,1,0,2,1,2,0,1,1,2,1,0,2,3,0,3,2,1
%N A325122 Sum of binary digits of the prime indices of n, minus Omega(n).
%C A325122 The sum of binary digits of an integer is the number of 1's in its binary representation. A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%F A325122 Totally additive with a(prime(n)) = A048881(n).
%t A325122 Table[Sum[pr[[2]]*(DigitCount[PrimePi[pr[[1]]],2,1]-1),{pr,If[n==1,{},FactorInteger[n]]}],{n,100}]
%Y A325122 Positions of zeros are A318400.
%Y A325122 Cf. A000120, A018900, A019565, A048881, A051438, A070939, A112798.
%Y A325122 Cf. A325103, A325104, A325106, A325118.
%Y A325122 Other totally additive sequences: A056239, A302242, A318994, A318995, A325033, A325034, A325120, A325121.
%K A325122 nonn
%O A325122 1,17
%A A325122 _Gus Wiseman_, Mar 29 2019