A333953 Recursively superabundant numbers: numbers m such that A330575(m)/m > A330575(k)/k for all k < m.

1, 2, 4, 6, 8, 12, 24, 36, 48, 72, 96, 120, 144, 240, 288, 360, 480, 576, 720, 1152, 1440, 2160, 2880, 4320, 5760, 8640, 11520, 17280, 25920, 30240, 34560, 51840, 60480, 69120, 103680, 120960, 172800, 181440, 207360, 241920, 345600, 362880, 414720, 483840, 725760

Offset

1,2

Comments

Fink (2019) defined this sequence. He asked whether 720 is the largest term that is also superabundant number (A004394).

He noted that up to 10^6 all the recursively superabundant numbers are also recursively highly composite numbers (A333952), except for 181440 (the next term which is not recursively highly composite is 2177280). He asked whether there are a finite number of numbers that are both recursively highly composite and recursively superabundant (in analogy to A166981).

From David A. Corneth, Apr 13 2020: (Start)

The 76 terms in the b-file are products of primorials (Cf. A025487) and 7-smooth numbers (Cf. A002473). All terms are in A025487.

Proof: As A330575(n) = Sum_{d|n} A074206(d) * n/d we have A330575(n) / n = Sum_{d|n} A074206(d)/d which is maximal for some prime signature when n is a product of primorials.

Assuming terms below 10^17 are 13-smooth gives the 213 11-smooth numbers in the Corneth a-file. (End)

Links

David A. Corneth, Table of n, a(n) for n = 1..213 (first 76 terms from Amiram Eldar)

Thomas Fink, Recursively divisible numbers, arXiv:1912.07979 [math.NT], 2019. See section 5.

Mathematica

s[1] = 1; s[n_] := s[n] = n + DivisorSum[n, s[#] &, # < n &]; seq={}; rm = 0; Do[r1 = s[n]/n; If[r1 > rm, rm = r1; AppendTo[seq, n]], {n, 1, 10^4}]; seq

Crossrefs

Cf. A002473, A004394, A166981, A025487, A330575, A333952.

Sequence in context: A308912 A333952 A301414 * A333963 A307187 A340014

Adjacent sequences: A333950 A333951 A333952 * A333954 A333955 A333956

Keyword

nonn

Author

Amiram Eldar, Apr 11 2020

Status

approved