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 A085887 #14 Mar 18 2023 13:00:06
%S A085887 2,3,3,4,3,4,3,4,4,5,3,4,3,4,4,5,3,4,3,4,4,5,3,4,4,5,4,6,3,4,3,4,4,5,
%T A085887 4,6,3,4,4,5,3,4,3,4,4,5,3,4,4,5,4,6,3,4,4,5,4,5,3,4,3,4,4,5,4,6,3,4,
%U A085887 4,5,3,4,3,4,4,5,4,6,3,4,4,5,3,4,4,5,4,6,3,4,4,5,4,5,4,6,3,4,4,5,3,4,3,4,4
%N A085887 Let r and s be such that r + s = n; a(n) = minimum value of tau(r) + tau(s).
%C A085887 a(p+1) = 3 if p is a prime. a(n) = 4 if n is the sum of two primes. For all even numbers > 4, a(n) = 4 by Goldbach's conjecture.
%H A085887 Antti Karttunen, <a href="/A085887/b085887.txt">Table of n, a(n) for n = 2..16385</a>
%e A085887 a(8) = 3, the partitions are (1,7), (2,6), (3,5), (4,4) which give 3, 6, 4 and 6 as the sum of the number of divisors of both parts.
%t A085887 Table[Min[Total/@DivisorSigma[0,IntegerPartitions[n,{2}]]],{n,2,120}] (* _Harvey P. Dale_, Mar 18 2023 *)
%o A085887 (PARI) A085887(n) = { my(m=0,k); for(r=1,n-1,if((m > k=(numdiv(r)+numdiv(n-r)))||!m, m = k)); m; }; \\ _Antti Karttunen_, Dec 14 2017
%Y A085887 Cf. A085883.
%K A085887 nonn
%O A085887 2,1
%A A085887 _Amarnath Murthy_, Jul 08 2003
%E A085887 More terms from _David Wasserman_, Feb 10 2005