The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A333926 The sum of recursive divisors of n. 9
1, 3, 4, 7, 6, 12, 8, 11, 13, 18, 12, 28, 14, 24, 24, 23, 18, 39, 20, 42, 32, 36, 24, 44, 31, 42, 31, 56, 30, 72, 32, 35, 48, 54, 48, 91, 38, 60, 56, 66, 42, 96, 44, 84, 78, 72, 48, 92, 57, 93, 72, 98, 54, 93, 72, 88, 80, 90, 60, 168, 62, 96, 104, 79, 84, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The definition of recursive divisors and the number of recursive divisors of n are in A282446.
First differs from A051378 at n = 256.
LINKS
FORMULA
Multiplicative with a(p^k) = 1 + Sum_{d recursive divisor of k} p^d.
a(n) <= A051378(n) <= A000203(n).
EXAMPLE
The recursive divisors of 8 are 1, 2 and 8, therefore a(8) = 1 + 2 + 8 = 11.
MATHEMATICA
recDivQ[n_, 1] = True; recDivQ[n_, d_] := recDivQ[n, d] = Divisible[n, d] && AllTrue[FactorInteger[d], recDivQ[IntegerExponent[n, First[#]], Last[#]] &]; recDivs[n_] := Select[Divisors[n], recDivQ[n, #] &]; f[p_, e_] := 1 + Total[p^recDivs[e]]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100]
CROSSREFS
Sequence in context: A353900 A366903 A049418 * A051378 A366440 A344575
KEYWORD
nonn,mult
AUTHOR
Amiram Eldar, Apr 10 2020
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 June 7 17:39 EDT 2024. Contains 373206 sequences. (Running on oeis4.)