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 A023891 #19 Jun 20 2022 04:21:32 %S A023891 0,0,0,4,0,6,0,12,9,10,0,22,0,14,15,28,0,33,0,34,21,22,0,54,25,26,36, %T A023891 46,0,61,0,60,33,34,35,85,0,38,39,82,0,83,0,70,69,46,0,118,49,85,51, %U A023891 82,0,114,55,110,57,58,0,157,0,62,93,124,65,127,0,106,69,129,0 %N A023891 Sum of composite divisors of n. %H A023891 Vincenzo Librandi, <a href="/A023891/b023891.txt">Table of n, a(n) for n = 1..1000</a> %F A023891 a(n) = A023890(n) - 1. - _Sean A. Irvine_, Jun 11 2019 %t A023891 Array[ Plus @@ (Select[ Divisors[ # ], (!PrimeQ[ # ] && #>1)& ])&, 75 ] %t A023891 a[n_] := DivisorSigma[1, n] - Plus @@ FactorInteger[n][[;; , 1]] - 1; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Jun 20 2022 *) %o A023891 (PARI) a(n) = sumdiv(n, d, d*!isprime(d)) - 1; \\ _Michel Marcus_, Jun 12 2019 %Y A023891 Cf. A000203, A035322, A035321, A060278, A023890. %K A023891 nonn %O A023891 1,4 %A A023891 _Olivier Gérard_