A071927 -id:A071927 - cp's OEIS frontend

A362053 Primitive abundant numbers k (A071395) whose abundancy index sigma(k)/k has a record low value.

20, 70, 88, 104, 464, 650, 1888, 1952, 4030, 5830, 8925, 17816, 32128, 77744, 91388, 128768, 130304, 442365, 521728, 522752, 1848964, 8353792, 8378368, 8382464, 35021696, 45335936, 120888092, 134193152, 775397948, 1845991216, 2146926592, 2146992128, 3381872252

Offset: 1

Amiram Eldar, Apr 06 2023

nonn

The abundancy index of an integer k is sigma(k)/k, where sigma is the sum-of-divisors function (A000203).

Terms k of A071395 such that sigma(k)/k < sigma(m)/m for all smaller terms m < k of A071395.

			The abundancy indices of the first terms are 21/10 > 72/35 > 45/22 > 105/52 > 465/232 > 651/325 > 945/472 > ... > 2.

Cf. A000203, A071395, A071927.

Other sequences related to records in A071395: A083873, A334419.

f1[p_, e_] := (p^(e + 1) - 1)/(p^(e + 1) - p^e); f2[p_, e_] := (p^(e + 1) - p)/(p^(e + 1) - 1);
(* Returns the abundancy index of n if n is primitive abundant, and 0 otherwise: *)
abIndex[n_] := If[(r = Times @@ f1 @@@ (f = FactorInteger[n])) > 2 && r * Max @@ f2 @@@ f < 2, r, 0]; abIndex[1] = 0;
seq[kmax_] := Module[{s = {}, ab, abm = 3}, Do[If[0 < (ab = abIndex[k]) < abm, abm = ab; AppendTo[s, k]], {k, 1,  kmax}]; s]; seq[10^6]

abindex(n) = {my(f = factor(n), r, p, e); r = sigma(f, -1); if(r <= 2, return(0)); if(vecmax(vector(#f~, i, p = f[i, 1]; e = f[i, 2]; (p^(e + 1) - p)/(p^(e + 1) - 1))) * r < 2, r, 0);} \\ Returns the abundancy index of n if n is primitive abundant, and 0 otherwise.
lista(kmax) = {my(ab, abm = 3); for(k = 1, kmax, ab = abindex(k); if(ab > 0 && ab < abm, abm = ab; print1(k, ", "))); }

A362052 Practical numbers (A005153) that are abundant and have a record low value of abundancy index.

Original entry on oeis.org

12, 18, 20, 88, 104, 464, 1888, 1952, 29056, 29312, 29824, 30592, 30848, 32128, 127744, 128768, 130304, 521728, 522752, 8341504, 8353792, 8378368, 8382464, 134029312, 134045696, 134094848, 134193152, 2146926592, 2146992128, 8586723328, 8587902976, 8589082624

Offset: 1

Amiram Eldar, Apr 06 2023

nonn

The abundancy index of an integer k is sigma(k)/k, where sigma is the sum-of-divisors function (A000203).
All the perfect numbers (A000396) are practical, and their abundancy index is 2.
If k is a deficient practical number, then sigma(k) = 2*k - 1 (i.e., k is an almost-perfect number, and the only known such numbers are the powers of 2, A000079), so the abundancy index of these numbers approaches to the limit 2 from below.
All the terms are either of the form 2^m*p, where p < 2^(m+1) - 1 is a prime, or of the form 2^m*p^2, where p = 2^(m+1) - 1 is a prime.
This sequence is infinite since the abundancy index of practical numbers can be arbitrarily close to 2 from above: if k = 2^m*p, and p < 2^(m+1) - 1 then k is practical, and its abundancy index is (2-1/2^m)*(1+1/p) < 2 + 2/p. Therefore, for all eps > 0, taking a prime p and m such that 2/eps < p < 2^(m+1) - 1 will yield a practical number k = 2^m*p with 2 < sigma(k)/k < 2 + eps.

			The abundancy indices of the first terms are 7/3 > 13/6 > 21/10 > 45/22 > 105/52 > 465/232 > 945/472 > ... > 2.

Wikipedia, Practical number.

Subsequence of A005101 and A005153.

Cf. A000079, A000203, A000396, A071927, A335029, A335030.

f[p_, e_] := (p^(e + 1) - 1)/(p - 1); pracQ[fct_] := Position[fct[[;; , 1]]/(1 + FoldList[Times, 1, f @@@ Most@ fct]), _?(# > 1 &)] == {};
seq = {}; rm = 3; Do[fct = FactorInteger[n]; r = Times @@ (((First /@ fct)^(1 + Last /@ fct) - 1)/(First /@ fct - 1))/n; If[2 < r < rm && pracQ[fct], rm = r; AppendTo[seq, n]], {n, 3, 10^6}]; seq

lista(kmax) = {my(f, r, rm = 3, prd, prac); forstep(k = 2, kmax, 2, f = factor(k); r = sigma(f, -1); if(r > 2 && r < rm, prd = 1; prac = 1; for(i=2, #f~, prd *= sigma(f[i-1, 1]^f[i-1, 2]); if(f[i, 1] > 1 + prd, prac = 0; break)); if(prac, rm = r; print1(k, ", ")))); }

cp's OEIS Frontend

A362053 Primitive abundant numbers k (A071395) whose abundancy index sigma(k)/k has a record low value.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI