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 A322869 #14 Dec 31 2018 13:23:27
%S A322869 0,1,1,1,1,2,1,2,1,2,1,1,1,2,2,1,1,2,1,2,2,2,1,2,1,2,2,2,1,3,1,2,2,2,
%T A322869 2,2,1,2,2,3,1,3,1,2,1,2,1,2,1,2,2,2,1,3,2,3,2,2,1,1,1,2,2,2,2,3,1,2,
%U A322869 2,3,1,3,1,2,2,2,2,3,1,1,1,2,1,2,2,2,2,3,1,2,2,2,2,2,2,3,1,2,2,2,1,3,1,3,3
%N A322869 a(n) = A000120(A048675(n)).
%H A322869 Antti Karttunen, <a href="/A322869/b322869.txt">Table of n, a(n) for n = 1..16384</a>
%H A322869 Antti Karttunen, <a href="/A322869/a322869.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A322869 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A322869 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A322869 a(n) = A000120(A048675(n)) = A000120(A322821(n)).
%F A322869 a(n) = A001221(A097248(n)) = A001222(A097248(n)).
%F A322869 If n is squarefree, then a(n) = A001221(n) = A322862(n).
%F A322869 a(A002110(n)) = n.
%t A322869 Array[If[# == 1, 0, DigitCount[Total@ Map[#2*2^(PrimePi@ #1 - 1) & @@ # &, FactorInteger[#]], 2, 1]] &, 105] (* _Michael De Vlieger_, Dec 31 2018 *)
%o A322869 (PARI)
%o A322869 A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; }; \\ From A048675
%o A322869 A322869(n) = hammingweight(A048675(n));
%Y A322869 Cf. A000120, A001221, A001222, A048675, A097248, A322821, A322862, A322868.
%Y A322869 Cf. A002110 (position of the first occurrence of n).
%K A322869 nonn
%O A322869 1,6
%A A322869 _Antti Karttunen_, Dec 31 2018