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 A336929 #7 Aug 11 2020 10:38:35
%S A336929 0,1,0,1,1,1,0,3,2,2,1,1,1,1,1,1,2,3,2,2,0,2,1,3,1,2,2,1,3,2,0,3,1,3,
%T A336929 1,3,3,3,1,4,2,1,2,2,3,2,1,1,4,2,2,2,3,3,2,3,2,4,3,2,1,1,2,1,2,2,3,3,
%U A336929 1,2,2,5,4,4,1,3,1,2,2,2,4,3,2,1,3,3,3,4,4,4,1,2,0,2,3,3,2,5,3,2,4,3,2,4,1
%N A336929 a(n) = A331410(sigma(n)), where A331410 is totally additive with a(2) = 0 and a(p) = 1 + a(p+1) for odd primes.
%H A336929 Antti Karttunen, <a href="/A336929/b336929.txt">Table of n, a(n) for n = 1..65537</a>
%H A336929 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A336929 Additive with a(p^e) = A331410(sigma(p^e)) = A331410(1+ p + p^2 + ... + p^e).
%F A336929 a(n) = A331410(A000203(n)).
%o A336929 (PARI)
%o A336929 A331410(n) = { my(f=factor(n)); sum(k=1,#f~,if(2==f[k,1],0,f[k,2]*(1+A331410(f[k,1]+1)))); };
%o A336929 A336929(n) = A331410(sigma(n));
%Y A336929 Cf. A000203, A331410.
%Y A336929 Cf. also A336695, A336927, A336928.
%K A336929 nonn
%O A336929 1,8
%A A336929 _Antti Karttunen_, Aug 11 2020