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 A335881 #9 Jun 30 2020 00:16:17
%S A335881 0,0,1,0,2,1,2,0,2,2,2,1,2,2,3,0,3,2,3,2,3,2,3,1,4,2,3,2,4,3,3,0,3,3,
%T A335881 3,2,4,3,3,2,3,3,4,2,4,3,4,1,4,4,4,2,4,3,4,2,4,4,4,3,3,3,4,0,4,3,4,3,
%U A335881 4,3,4,2,5,4,5,3,4,3,4,2,4,3,3,3,5,4,5,2,5,4,4,3,4,4,5,1,3,4,4,4,5,4,3,2,4
%N A335881 a(n) = max(A329697(n), A331410(n)).
%H A335881 Antti Karttunen, <a href="/A335881/b335881.txt">Table of n, a(n) for n = 1..65537</a>
%F A335881 a(n) = max(A329697(n), A331410(n)).
%F A335881 For all n >= 1, A335904(n) >= A335884(n) >= a(n) >= A335875(n) >= A335885(n).
%o A335881 (PARI)
%o A335881 A329697(n) = { my(f=factor(n)); sum(k=1,#f~,if(2==f[k,1],0,f[k,2]*(1+A329697(f[k,1]-1)))); };
%o A335881 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 A335881 A335881(n) = max(A329697(n),A331410(n));
%Y A335881 Cf. A329697, A331410, A335875, A335877, A335884, A335885, A335904.
%Y A335881 Cf. A329662 (apparently the positions of records).
%K A335881 nonn
%O A335881 1,5
%A A335881 _Antti Karttunen_, Jun 29 2020