A366763 -id:A366763 - cp's OEIS frontend

A366764 The sum of divisors of n that have no exponent 2 in their prime factorization.

1, 3, 4, 3, 6, 12, 8, 11, 4, 18, 12, 12, 14, 24, 24, 27, 18, 12, 20, 18, 32, 36, 24, 44, 6, 42, 31, 24, 30, 72, 32, 59, 48, 54, 48, 12, 38, 60, 56, 66, 42, 96, 44, 36, 24, 72, 48, 108, 8, 18, 72, 42, 54, 93, 72, 88, 80, 90, 60, 72, 62, 96, 32, 123, 84, 144, 68

Offset: 1

Amiram Eldar, Oct 21 2023

The sum of terms of A337050 that divide n.

The number of these divisors is A366763(n), and the largest of them is A366765(n).

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

Cf. A000203, A004709, A005117, A034448, A065487, A337050, A366763, A366765.

f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - p^2; f[p_, 1] := p + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i,2] == 1, f[i, 1] + 1, (f[i, 1]^(f[i,2] + 1) - 1)/(f[i, 1] - 1) - f[i, 1]^2));}

Multiplicative with a(p) = p + 1, and a(p^e) = (p^(e+1) - 1)/(p - 1) - p^2 for e >= 2.
a(n) <= A000203(n), with equality if and only if n is squarefree (A005117).
a(n) >= A034448(n), with equality if and only if n is cubefree (A004709).
Dirichlet g.f.: zeta(s-1) * zeta(s) * Product_{p prime} (1 - 1/p^(2*s-2) + 1/p^(3*s-3)).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = Product_{p prime} (1 + 1/(p^3-p)) = 1.231291... (A065487).

A366765 The largest divisor of n that have no exponent 2 in their prime factorization.

Original entry on oeis.org

1, 2, 3, 2, 5, 6, 7, 8, 3, 10, 11, 6, 13, 14, 15, 16, 17, 6, 19, 10, 21, 22, 23, 24, 5, 26, 27, 14, 29, 30, 31, 32, 33, 34, 35, 6, 37, 38, 39, 40, 41, 42, 43, 22, 15, 46, 47, 48, 7, 10, 51, 26, 53, 54, 55, 56, 57, 58, 59, 30, 61, 62, 21, 64, 65, 66, 67, 34, 69

Offset: 1

Amiram Eldar, Oct 21 2023

The largest term of A337050 that divides n.

The number of these divisors is A366763(n), and their sum is A366764(n).

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

Cf. A337050, A366763, A366764.

Similar sequences: A055231, A057521, A008833, A350390.

f[p_, e_] := p^If[e < 3, 1, e]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1] ^ if(f[i, 2] < 3, 1, f[i, 2]));}

Multiplicative with a(p^e) = p if e <= 2 and p^e otherwise.
a(n) <= n, with equality if and only if n is in A337050.
Dirichlet g.f.: zeta(s-1) * Product_{p prime} (1 - 1/p^(2*s-2) + 1/p^(2*s-1) + 1/p^(3*s-3) - 1/p^(3*s-2)).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = Product_{p prime} (1 - 1/p^2 + 2/p^3 - 1/p^4) = 0.83234421330425224469... .

cp's OEIS Frontend

A366764 The sum of divisors of n that have no exponent 2 in their prime factorization.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula