login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035322 Sum of composite divisors of n that are less than n and are not primes nor prime powers. 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 6, 0, 10, 0, 0, 0, 18, 0, 0, 0, 14, 0, 31, 0, 0, 0, 0, 0, 36, 0, 0, 0, 30, 0, 41, 0, 22, 15, 0, 0, 42, 0, 10, 0, 26, 0, 24, 0, 42, 0, 0, 0, 93, 0, 0, 21, 0, 0, 61, 0, 34, 0, 59, 0, 96, 0, 0, 15, 38, 0, 71, 0, 70, 0, 0, 0, 123, 0, 0, 0, 66, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

MATHEMATICA

Table[ Plus @@ Select[ Divisors[ n ], (Length[ FactorInteger[ # ] ]>1 && #<n )& ], {n, 1, 100} ]

scd[n_]:=Total[Select[Most[Divisors[n]], CompositeQ[#]&&!PrimePowerQ[#]&]]; Array[scd, 90] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jan 09 2019 *)

CROSSREFS

Cf. A000203, A035321, A023891, A060278.

Sequence in context: A294887 A331979 A005872 * A270031 A284105 A331928

Adjacent sequences:  A035319 A035320 A035321 * A035323 A035324 A035325

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Description corrected by Jack Brennen, Mar 28 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 03:20 EST 2020. Contains 338632 sequences. (Running on oeis4.)