[go: up one dir, main page]

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!)
A073181 Sum of divisors of n which are not greater than the squarefree kernel of n. 4
1, 3, 4, 3, 6, 12, 8, 3, 4, 18, 12, 16, 14, 24, 24, 3, 18, 12, 20, 22, 32, 36, 24, 16, 6, 42, 4, 28, 30, 72, 32, 3, 48, 54, 48, 16, 38, 60, 56, 30, 42, 96, 44, 40, 33, 72, 48, 16, 8, 18, 72, 46, 54, 12, 72, 36, 80, 90, 60, 108, 62, 96, 41, 3, 84, 144, 68, 58, 96, 144, 72, 16, 74 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) >= A048250(n).
EXAMPLE
The squarefree kernel of 56 = 7 * 2^3 is 14 = 7*2 and the divisors <= 14 of 56 are {1, 2, 4, 7, 8, 14}, therefore a(56) = 1 + 2 + 4 + 7 + 8 + 14 = 36.
MATHEMATICA
a[n_] := DivisorSum[n, # &, # <= Times @@ FactorInteger[n][[;; , 1]] &]; Array[a, 100] (* Amiram Eldar, Jul 09 2022 *)
PROG
(PARI)
A007947(n) = factorback(factorint(n)[, 1]); \\ This function from Andrew Lelechenko
A073181(n) = sumdiv(n, d, d*(d<=A007947(n))); \\ Antti Karttunen, Sep 10 2017, after Michel Marcus's code for A073183.
CROSSREFS
Sequence in context: A367503 A048250 A323363 * A183100 A340323 A046897
KEYWORD
nonn,look
AUTHOR
Reinhard Zumkeller, Jul 19 2002
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 August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)