A372740 -id:A372740 - cp's OEIS frontend

A372739 a(n) is the number of possible values of k such that the sum of aliquot coreful divisors of k (A336563) is n.

0, 1, 1, 0, 1, 3, 1, 0, 0, 2, 1, 1, 1, 3, 2, 0, 1, 1, 1, 0, 2, 2, 1, 1, 0, 2, 0, 0, 1, 6, 1, 0, 2, 2, 2, 1, 1, 2, 3, 0, 1, 5, 1, 0, 0, 2, 1, 0, 0, 0, 2, 0, 1, 0, 2, 1, 2, 2, 1, 2, 1, 3, 0, 0, 2, 4, 1, 0, 2, 4, 1, 0, 1, 2, 0, 0, 2, 5, 1, 1, 0, 2, 1, 1, 2, 2, 2

Offset: 1

Amiram Eldar, May 12 2024

nonn

A coreful divisor d of n is a divisor that is divisible by every prime that divides n (see also A307958).

			a(2) = 1 since there is 1 possible value of k, k = 4, such that A336563(k) = 2.
a(6) = 3 since there are 3 possible values of k, k = 8, 12 and 18, such that A336563(k) = 6.

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

Cf. A307958, A336563, A372740, A372742.

Similar sequences: A048138, A324938, A331971, A331973.

f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 0; s[n_] := Times @@ f @@@ FactorInteger[n] - n; seq[max_] := Module[{v = Table[0, {max}], i}, Do[i = s[k]; If[0 < i <= max, v[[i]]++], {k, 1, max^2}]; v]; seq[100]

s(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i, 1]^(f[i, 2] + 1) - 1)/(f[i, 1] - 1) - 1) - n;}
lista(nmax) = {my(v = vector(nmax), i); for(k = 1, nmax^2, i = s(k); if(i > 0 && i <= nmax, v[i]++)); v;}

a(n) = 0 if and only if n is in A372740.

a(n) = 1 if and only if n is in A372742.

A372741 Coreful highly touchable numbers: numbers m > 0 such that a record number of numbers k have m as the sum of the aliquot coreful divisors (A336563) of k.

Original entry on oeis.org

1, 2, 6, 30, 210, 930, 2310, 2730, 30030, 71610, 84630

Offset: 1

Amiram Eldar, May 12 2024

A coreful divisor d of n is a divisor that is divisible by every prime that divides n (see also A307958).
Indices of records of A372739.
The corresponding record values are 0, 1, 3, 6, 8, 9, 11, 12, 15, 16, 17, ... .
a(12) > 2*10^5.

			a(1) = 1 since it is the least number that is not the sum of aliquot coreful divisors of any number.
a(2) = 2 since it is the least number that is the sum of aliquot coreful divisors of one number: 2 = A336563(4).
a(3) = 6 since it is the least number that is the sum of aliquot coreful divisors of 3 numbers: 6 = A336563(8) = A336563(12) = A336563(18), and there is no number between 2 and 6 that is the sum of aliquot coreful divisors of exactly 2 numbers.

Cf. A307958, A336563, A372739, A372740.

Similar sequences: A238895, A325177, A331972, A331974.

f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 0; s[n_] := Times @@ f @@@ FactorInteger[n] - n; seq[m_] := Module[{v = Table[0, {m}], vm = -1, w = {}, i}, Do[i = s[k]; If[1 <= i <= m, v[[i]]++], {k, 1, m^2}]; Do[If[v[[k]] > vm, vm = v[[k]]; AppendTo[w, k]], {k, 1, m}]; w]; seq[1000]

s(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i, 1]^(f[i, 2] + 1) - 1)/(f[i, 1] - 1) - 1) - n;}
lista(nmax) = {my(v = vector(nmax), vmax = -1, i); for(k = 1, nmax^2, i = s(k); if(i > 0 && i <= nmax, v[i]++)); for(k = 1, nmax, if(v[k] > vmax, vmax = v[k]; print1(k, ", ")));}

cp's OEIS Frontend

A372739 a(n) is the number of possible values of k such that the sum of aliquot coreful divisors of k (A336563) is n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula