A287957 -id:A287957 - cp's OEIS frontend

A333926 The sum of recursive divisors of n.

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

Offset: 1

Amiram Eldar, Apr 10 2020

The definition of recursive divisors and the number of recursive divisors of n are in A282446.

First differs from A051378 at n = 256.

			The recursive divisors of 8 are 1, 2 and 8, therefore a(8) = 1 + 2 + 8 = 11.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000203, A051378, A282446, A287957, A287958.

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]

Multiplicative with a(p^k) = 1 + Sum_{d recursive divisor of k} p^d.

a(n) <= A051378(n) <= A000203(n).

A287958 Table read by antidiagonals: T(n, k) = least recursive multiple of n and k; n > 0 and k > 0.

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 4, 6, 6, 4, 5, 4, 3, 4, 5, 6, 10, 12, 12, 10, 6, 7, 6, 15, 4, 15, 6, 7, 8, 14, 6, 20, 20, 6, 14, 8, 9, 8, 21, 12, 5, 12, 21, 8, 9, 10, 18, 24, 28, 30, 30, 28, 24, 18, 10, 11, 10, 9, 64, 35, 6, 35, 64, 9, 10, 11, 12, 22, 30, 36, 40, 42, 42, 40

Offset: 1

Rémy Sigrist, Jun 03 2017

We say that m is a recursive multiple of d iff d is a recursive divisor of m (as described in A282446).
More informally, the prime tower factorization of T(n, k) is the union of the prime tower factorizations of n and k (the prime tower factorization of a number is defined in A182318).
This sequence has connections with the classical LCM (A003990).
For any i > 0, j > 0 and k > 0:
- A007947(T(i, j)) = A007947(lcm(i, j)),
- T(i, j) >= 1,
- T(i, j) >= max(i, j),
- T(i, j) >= lcm(i, j),
- T(i, 1) = i,
- T(i, i) = i,
- T(i, j) = T(j, i) (the sequence is commutative),
- T(i, T(j, k)) = T(T(i, j), k) (the sequence is associative),
- T(i, i*j) >= i*j,
- if gcd(i, j) = 1 then T(i, j) = i*j.
See also A287957 for the GCD equivalent.

			Table starts:
n\k|     1   2   3   4   5   6   7   8   9  10
---+-----------------------------------------------
1  |     1   2   3   4   5   6   7   8   9  10  ...
2  |     2   2   6   4  10   6  14   8  18  10  ...
3  |     3   6   3  12  15   6  21  24   9  30  ...
4  |     4   4  12   4  20  12  28  64  36  20  ...
5  |     5  10  15  20   5  30  35  40  45  10  ...
6  |     6   6   6  12  30   6  42  24  18  30  ...
7  |     7  14  21  28  35  42   7  56  63  70  ...
8  |     8   8  24  64  40  24  56   8  72  40  ...
9  |     9  18   9  36  45  18  63  72   9  90  ...
10 |    10  10  30  20  10  30  70  40  90  10  ...
...
T(4, 8) = T(2^2, 2^3) = 2^(2*3) = 2^6 = 64.

Rémy Sigrist, First 100 antidiagonals of array, flattened
Rémy Sigrist, Illustration of the first terms

Cf. A003990, A007947, A182318, A282446, A287957.

T(n,k) = if (n*k==0, return (max(n,k))); my (g=factor(lcm(n,k))); return (prod(i=1, #g~, g[i,1]^T(valuation(n, g[i,1]), valuation(k, g[i,1]))))

cp's OEIS Frontend

A333926 The sum of recursive divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula