login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023891 Sum of composite divisors of n. 6
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, 46, 0, 61, 0, 60, 33, 34, 35, 85, 0, 38, 39, 82, 0, 83, 0, 70, 69, 46, 0, 118, 49, 85, 51, 82, 0, 114, 55, 110, 57, 58, 0, 157, 0, 62, 93, 124, 65, 127, 0, 106, 69, 129, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = A023890(n) - 1. - Sean A. Irvine, Jun 11 2019
MATHEMATICA
Array[ Plus @@ (Select[ Divisors[ # ], (!PrimeQ[ # ] && #>1)& ])&, 75 ]
a[n_] := DivisorSigma[1, n] - Plus @@ FactorInteger[n][[;; , 1]] - 1; a[1] = 0; Array[a, 100] (* Amiram Eldar, Jun 20 2022 *)
PROG
(PARI) a(n) = sumdiv(n, d, d*!isprime(d)) - 1; \\ Michel Marcus, Jun 12 2019
CROSSREFS
Sequence in context: A075083 A179939 A163407 * A075091 A132953 A195207
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)