A224078 -id:A224078 - cp's OEIS frontend

A332241 Indices of A224078(n) in A025487.

2, 4, 6, 13, 17, 27, 55, 67, 138, 264, 314, 406, 582, 1046, 1835, 3609, 16371, 75611, 118893, 342363

Offset: 1

Michael De Vlieger, Feb 07 2020

A224078: Superior highly composite numbers that are colossally abundant. Such numbers are also found in A025487.

Finite and full, since A224078 is finite with 20 terms.

Block[{s = TakeWhile[Import["https://oeis.org/A025487/b025487.txt", "Data"], Length@ # > 0 &][[All, -1]], t = Map[ToExpression[StringSplit[#][[1, -1]] ] &, Rest@ StringSplit[Import["https://oeis.org/A224078/b224078.txt", "Data"], "\n"]]}, Reap[Do[Which[Length@ t == 0, Break[], First[t] == s[[i]], t = Rest@ t; Sow[i]], {i, Length@ s}]][[-1, -1]]]

A166981 Superabundant numbers (A004394) that are highly composite (A002182).

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680, 2520, 5040, 10080, 15120, 25200, 27720, 55440, 110880, 166320, 277200, 332640, 554400, 665280, 720720, 1441440, 2162160, 3603600, 4324320, 7207200, 8648640, 10810800

Offset: 1

T. D. Noe, Oct 26 2009

The intersection of superabundant and highly composite numbers has exactly 449 terms, the largest of which is 2^10 * 3^6 * 5^4 * 7^3 * 11^3 * 13^2 * 17^2 * 19^2 * 23^2 * 29 * 31 * 37*...*347.
The argument showing that this is a finite sequence seems to be given in A166735. - N. J. A. Sloane, Jan 04 2019
Pillai proved that this sequence is finite and asked for its number of terms (he used the term "highly abundant" for superabundant numbers). - Amiram Eldar, Jun 30 2019
From Michael De Vlieger, Dec 29 2020: (Start)
All terms are products of primorials (numbers in A002110), thus, all terms are also in A025487, itself a subsequence of A055932.
Since the colossally abundant numbers (CA, A004490) are also superabundant, and since the superior highly composite (SHC A002201) numbers are also highly composite, the finite sequence A224078 containing numbers both CA and SHC is a subsequence of this sequence. Likewise, A304234 (numbers that are SA, HC, & SHC but not CA) and A304235 (numbers that are SA, HC, & CA but not SHC), and A338786 (SA and HC, but neither CA nor SHC) are mutually exclusive finite subsequences of this sequence. (End)

T. D. Noe, Table of n, a(n) for n = 1..449 (complete sequence)
Michael De Vlieger, Annotated plot of a(n) at (x,y) = (a(n)/P), P) where P = A002110(A001221(a(n)) showing all 449 terms.
Thomas Fink, Recursively divisible numbers, arXiv:1912.07979 [math.NT], 2019. Mentions this sequence.
S. Sivasankaranarayana Pillai, Highly abundant numbers, Bulletin of the Calcutta Mathematical Society, Vol. 35, No. 1 (1943), pp. 141-156.
S. Sivasankaranarayana Pillai, On numbers analogous to highly composite numbers of Ramanujan, Rajah Sir Annamalai Chettiar Commemoration Volume, ed. Dr. B. V. Narayanaswamy Naidu, Annamalai University, 1941, pp. 697-704.

Cf. A002110, A002182, A004394, A025487, A055932, A166735 (SA numbers that are not HC numbers), A224078, A304234, A304235, A308913, A338786.

A304234 Superior highly composite numbers that are superabundant but not colossally abundant.

Original entry on oeis.org

13967553600, 2248776129600, 65214507758400, 195643523275200, 12129898443062400, 448806242393308800, 18401055938125660800, 185942670254759802384000, 9854961523502269526352000, 1162885459773267804109536000, 780296143507862696557498656000

Offset: 1

Michael De Vlieger, May 08 2018

Numbers m in A002201 that are also in A004394 but not A004490.
Subset of A166981. Numbers in this sequence are in neither A224078 nor A304235.
There are 39 terms in this sequence.
The smallest term is 2^5 * 3^2 * 5 * A002110(8) or the product of A002110(k) with k = {1,1,1,2,3,8}.
The largest is 2^10 * 3^6 * 5^3 * 7^2 * 11 * 13 * 17 * 19 * 23 * A002110(65) or the product of A002110(k) with k = {1,1,1,1,2,2,2,3,4,9,65}, a 144 digit decimal number.

Michael De Vlieger, Table of n, a(n) for n = 1..39
Michael De Vlieger, Superior highly composite numbers m that are also superabundant but not colossally abundant
Michael De Vlieger, Color coded plot of m A002182 and A004394 at (x,y) where A301414(x) * A002110(y) = m, terms in this sequence are colored dark blue.
Michael De Vlieger, Annotated plot of a(n) for 1 <= n <= 39 at (x,y) = (a(n)/A002110(A001221(a(n)), A002110(A001221(a(n)))

Cf. A002110, A002182, A002201, A004394, A004490, A166981, A224078, A304235.

(* First, download b-files at A002201, A004394, and A004490 *)
f[w_] := Times @@ Flatten@ {Complement[#1, Union[#2, #3]], Product[Prime@ i, {i, PrimePi@ #}] & /@ #2, Factorial /@ #3} & @@ ToExpression@ {StringSplit[w, _?(! DigitQ@ # &)], StringCases[w, (x : DigitCharacter ..) ~~ "#" :> x], StringCases[w, (x : DigitCharacter ..) ~~ "!" :> x]};
With[{s = Import["b002201.txt", "Data"][[All, -1]], t = Select[Map[Which[StringTake[#, 1] == {"#"}, f@ Last@ StringSplit@ Last@ #, StringTake[#, 1] == {}, Nothing, True, ToExpression@ StringSplit[#][[1, -1]]] &, Drop[Import["b004394.txt", "Data"], 3] ], IntegerQ@ First@ # &][[All, -1]], u = Import["b004490.txt", "Data"][[All, -1]]}, Select[Intersection[s, t], FreeQ[u, #] &]]

A304235 Colossally abundant numbers that are highly composite, but not superior highly composite.

Original entry on oeis.org

160626866400, 9316358251200, 288807105787200, 2021649740510400, 224403121196654400, 9200527969062830400, 395622702669701707200, 1970992304700453905270400, 35468006523084668025340848000, 135483209545341953934626770390608000

Offset: 1

Michael De Vlieger, May 08 2018

Numbers m in A004490 that are also in A002182 but not A002201.
Subset of A166981. Numbers in this sequence are in neither A224078 nor A304234.
There are 32 terms in this sequence.
The smallest term is 2^4 * 3^2 * 5 * A002110(9) or the product of k = {1,1,2,3,9} in A002110.
The largest term is 2^9 * 3^5 * 5^3 * 7^2 * 11 * 13 * 17 * 19 * 23 * A002110(66) or the product of A002110(k) with k = {1,1,1,1,2,2,3,4,9,66}, a 146 digit decimal number.

Michael De Vlieger, Table of n, a(n) for n = 1..32
Michael De Vlieger, Colossally abundant m that are also highly composite but not superior highly composite
Michael De Vlieger, Color coded plot of m A002182 and A004394 at (x,y) where A301414(x) * A002110(y) = m, terms in this sequence are colored dark red.
Michael De Vlieger, Annotated plot of a(n) for 1 <= n <= 32 at (x,y) = (a(n)/A002110(A001221(a(n)), A002110(A001221(a(n)))

Cf. A002110, A002182, A002201, A004394, A004490, A166981, A224078, A304234.

(* First, download b-files at A002182, A002201, and A004490 *)
With[{s = Import["b004490.txt", "Data"][[All, -1]], t = Import["b002182.txt", "Data"][[All, -1]], u = Import["b002201.txt", "Data"][[All, -1]]}, Select[Intersection[s, t], FreeQ[u, #] &]]

A305056 a(n) = A004394(n)/A002110(A001221(A004394(n))).

Original entry on oeis.org

1, 1, 2, 1, 2, 4, 6, 8, 2, 4, 6, 8, 12, 24, 4, 6, 8, 12, 24, 48, 72, 120, 12, 24, 48, 72, 120, 144, 240, 288, 24, 48, 72, 120, 144, 240, 288, 360, 720, 72, 120, 144, 240, 288, 360, 720, 72, 1440, 2160, 120, 144, 240, 288, 360, 720, 1440, 2160, 2880, 4320, 5040

Offset: 1

Michael De Vlieger, Jul 01 2018

nonn

This sequence is analogous to A301413, which pertains to A002182.
Since A002182(20) = 7560 is not in A004394, a(20) =/= A301413(20), i.e., the former is 36, the latter 48. (The number 36 is not in this sequence, but is in A301413.)
A004394(50) = 120*A002110(8) is the smallest number in A004394 but not in A002182; in A004394 we have 120*A002110(m) for 4 <= m <= 8, while in A002110 we have 120*A002110(m) for 4 <= m <= 7. Therefore this sequence has one more instance of 120 (= a(50)) than exists in A301413.

			Let m be a value in this sequence. The table below shows m*A002110(A001221(A004394(k))). Columns are A001221(A004394(k)), rows are m whose products m*A002110(A001221(A004394(k))) appear in A004394 are in this sequence. Numbers in A004394 that also appear in A004490 are followed by (*).
         0     1     2      3      4       5         6  ...
      +----------------------------------------------------
   1  |  1     2*    6*
   2  |        4    12*    60*
   4  |             24    120*   840
   6  |             36    180   1260
   8  |             48    240   1680
  12  |                   360*  2520*  27720
  24  |                   720   5040*  55440*   720720*
Up to this point, the graph of this sequence and that of A301413 are identical; the asterisks pertain to numbers in A002201 in the case of A301413, but all the numbers on the graph are found in both A004490 and A002201, i.e., in A224078. The next two rows of the graph of A301413:
       0     1     2      3      4       5         6  ...
      +----------------------------------------------------
  36  |                         7560   83160   1081080
  48  |                        10080  110880   1441440*
  ...
but this sequence does not have row m = 36, as {7560, 83160, 1081080} are not in A004394.

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

Cf. A001221, A002110, A004394, A301413.

Block[{s = Array[DivisorSigma[1, #]/# &, 10^6], t}, t = Union@ FoldList[Max, s]; Map[#/Product[Prime@ i, {i, PrimeNu@ #}] &@ First@ FirstPosition[s, #] &, t]]

A338786 Numbers in A166981 that are neither superior highly composite nor colossally abundant.

Original entry on oeis.org

1, 4, 24, 36, 48, 180, 240, 720, 840, 1260, 1680, 10080, 15120, 25200, 27720, 110880, 166320, 277200, 332640, 554400, 665280, 2162160, 3603600, 7207200, 8648640, 10810800, 36756720, 61261200, 73513440, 122522400, 147026880, 183783600, 698377680, 735134400, 1102701600

Offset: 1

Michael De Vlieger, Nov 09 2020

These are numbers both highly composite and superabundant but neither superior highly composite nor colossally abundant.
This sequence, A224078, A304234, and A304235 are mutually exclusive subsets that comprise A166981.
Superset A166981 has 449 terms; this sequence has 358, A224078 has 20, A304234 has 39, and A304235 has 32.

			1 is in the sequence since it is the empty product, setting records for both the number of divisors and the sum of divisors, and it is neither also superior highly composite nor colossally abundant.
2 is not in the sequence since it is both colossally abundant and superior highly composite.
4 is in the sequence since it sets a record for the divisor counting and divisor sum functions, yet it is neither superior highly composite nor colossally abundant.
20951330400 is not in the sequence since it is colossally abundant though it is an HCN and SA. etc.

Michael De Vlieger, Table of n, a(n) for n = 1..358
Michael De Vlieger, Annotated plot of a(n) at (x,y) = (a(n)/A002110(A001221(a(n)), A002110(A001221(a(n)))
Eric Weisstein's World of Mathematics, Highly Composite Number
Eric Weisstein's World of Mathematics, Colossally Abundant Number
Eric Weisstein's World of Mathematics, Superabundant Number
Eric Weisstein's World of Mathematics, Superior Highly Composite Number

Cf. A189228, A002201, A002182, A004394, A004490, A166981, A224078, A304234, A304235.

Complement[Import["https://oeis.org/A166981/b166981.txt", "Data"][[1 ;; 449, -1]], Union[FoldList[Times, Import["https://oeis.org/A073751/b073751.txt", "Data"][[1 ;; 120, -1]] ], FoldList[Times, Import["https://oeis.org/A000705/b000705.txt", "Data"][[1 ;; 120, -1]] ] ] ] (* Program reads OEIS b-files Michael De Vlieger, Nov 09 2020 *)

Complement of (the union of A002182 and A004394) and (the union of A002201 and A004490).

A340840 Union of the highly composite and superabundant numbers.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680, 2520, 5040, 7560, 10080, 15120, 20160, 25200, 27720, 45360, 50400, 55440, 83160, 110880, 166320, 221760, 277200, 332640, 498960, 554400, 665280, 720720, 1081080, 1441440, 2162160, 2882880

Offset: 1

Michael De Vlieger, Jan 27 2021

nonn

Numbers m that set records in A000005 and numbers k that set records for the ratio A000203(k)/k, sorted, with duplicates removed.
All terms are in A025487, since all terms in A002182 and A004394 are products of primorials P in A002110.
For numbers that are highly composite but not superabundant, see A308913; for numbers that are superabundant but not highly composite, see A166735. - Jon E. Schoenfield, Jun 14 2021

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Annotated scatterplot of a(n) = A301414(x) * A002110(y) at (x, y) showing the intersection A166981 of A002182 and A004394, and the intersection A224078 of A002201 and A004490.

Cf. A000005, A000203, A027750, A002110.
Supersets: A025487, A055932.
Subsets: A002182, A002201, A004394, A004490, A166735, A166981, A168263, A189228, A224078, A304234, A304235, A308913, A333655, A338786.

(* Load the function f[] at A025487, then: *) Block[{t = Union@ Flatten@ f[15], a = {}, b = {}, d = 0, s = 0}, Do[(If[#2 > d, d = #2; AppendTo[a, #1]]; If[#3/#1 > s, s = #3/#1; AppendTo[b, #1]]) & @@ Flatten@ {t[[i]], DivisorSigma[{0, 1}, t[[i]]]}, {i, Length@ t}]; Union[a, b]]

A328549 1, together with the numbers that are simultaneously superior highly composite (A002201), colossally abundant (A004490), deeply composite (A095848), and miserable average divisor numbers (A263572).

Original entry on oeis.org

1, 2, 6, 12, 60, 120, 360, 2520, 5040, 55440, 720720, 1441440

Offset: 1

N. J. A. Sloane, Oct 20 2019

Presumably there are no further terms.
From Hal M. Switkay, Nov 04 2019: (Start)
1. a(n+1) is the product of the first n terms of A328852.
2. This sequence is most rapidly constructed as the intersection of A095849 and A224078. It is designed to list all potential solutions to a question. Let n be a natural number, k real <= 0, e real > 0. Let P(n,k,e) state: on the domain of natural numbers, sigma_k(x)/x^e reaches a maximum at x = n. This implies Q(n,k): sigma_k(n) > sigma_k(m) for m < n a natural number. We ask: for which natural numbers n is it true for all real k <= 0 that there is a real e > 0 such that P(n,k,e)?
If any such n exist, they must belong to the present sequence. A095849 consists of all natural numbers n such that for all real k <= 0, Q(n,k) holds. A224078 consists of all natural numbers n such that for some real e0 and e1 both > 0, P(n,0,e0) and P(n,-1,e1) hold. It would be interesting to see the list of n for which there is an e2 > 0 such that P(n,-2,e2) holds.
Conjecture: the solutions to this problem, if any, form an initial sequence of the present sequence. (End)
Every term of this sequence is also in A065385: a record for the cototient function. - Hal M. Switkay, Feb 27 2021
Every term of this sequence, except the first, is also in A210594: factor-dense numbers. - Hal M. Switkay, Mar 29 2021

Hal M. Switkay, Email to N. J. A. Sloane, Oct 20 2019

1 together with the intersection of A002201, A004490, A095848, A263572.

Cf. A095849, A224078, A328852, A210594.

A340014 Numbers k in A305056 such that k * A002110(j) is in A004394 for some j >= 0.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 24, 48, 72, 120, 144, 240, 288, 360, 720, 1440, 2160, 2880, 4320, 5040, 8640, 10080, 15120, 20160, 30240, 60480, 120960, 151200, 181440, 241920, 302400, 604800, 907200, 1209600, 1330560, 1663200, 1814400, 3326400, 6652800, 9979200, 13305600

Offset: 1

Michael De Vlieger, Dec 29 2020

nonn

Let m be a superabundant number. Since m is a product of primorials P, we may identify a greatest primorial divisor P(omega(m)) = A002110(A001221(A004394(n))).
This sequence lists the primitive quotients k = m/P(omega(m)).
Since m is a product of primorials and k is the quotient resulting from division of m by the largest primorial divisor P, this sequence is also a subset of A025487, which in turn is a subset of A055932.
We can plot all m in A004394 at (A002110(j),k), but this sequence does not accommodate all highly composite numbers; it is missing k = {36, 96, 216, 480, ...}. In contrast, k in A301414 can represent all superabundant numbers m, but a(116)=592424239959167616000 is the least k missing. Therefore in order to plot both A002182 and A004394 one must use the union of a(n) and A301414(n). One can ably plot all the terms common to both A002182 and A004394 (i.e., A166981) using k in A301414.

			Plot of (A002110(j),k) with k a term in this sequence such that A002110(j) * k is in A004394. Asterisks denote products that are in A004490.
   {0,1} {1,1} {2,1}
     1     2*    6*
         {1,2} {2,2} {3,2}
           4     12*   60*
               {2,4} {3,4}  {4,4}
                 24   120*   840
               {2,6} {3,6}  {4,6}
                 36   180    1260
               {2,8} {3,8}  {4,8}
                 48   240    1680
                    {3,12} {4,12}   {5,12}
                      360*   2520*   27720
                    {3,24} {4,24}   {5,24}    {6,24}
                      720    5040*   55440*   720720*
                           {4,48}   {5,48}    {6,48}
                            10080   110880   1441440*
                            ...     ...      ...       ...
This table is missing 7560, 83160, 1081080 at {4,36}, {5,36}, and {6,36}, respectively, which are numbers in A002182 but not in A004394. Thus, 36 is in A301414 but not in this sequence.

Michael De Vlieger, Table of n, a(n) for n = 1..2000
Michael De Vlieger, Annotated color-coded plot (x,y) = (a(n), A002110(j)) highlighting superabundant numbers.
Michael De Vlieger, Extended annotated color-coded plot showing all terms in A004394 that also appear in A224078.
Michael De Vlieger, Simple extended color-coded plot (x,y) = (a(n), A002110(m)) for coordinates between (1,0)..(225,379), with (1,0) in lower left corner.

Cf. A002110, A004394, A004490, A025487, A055932, A301414, A305056.

Block[{s = Array[DivisorSigma[1, #]/# &, 10^6], t}, t = Union@ FoldList[Max, s]; Union@ Map[#/Product[Prime@ i, {i, PrimeNu@ #}] &@ First@ FirstPosition[s, #] &, t]]

A340137 Numbers k in A305056 such that k*A002110(j) is in A004490.

Original entry on oeis.org

1, 2, 4, 12, 24, 48, 144, 720, 1440, 10080, 30240, 60480, 302400, 3326400, 6652800, 19958400, 259459200, 518918400, 3632428800, 61751289600, 1173274502400, 3519823507200, 17599117536000, 35198235072000, 809559406656000, 1619118813312000, 46954445586048000

Offset: 1

Michael De Vlieger, Jan 08 2021

nonn

All terms are in A025487, since all terms m in A004490 are products of primorials P in A002110.

Let Q = A002110(A001221(m)) be the largest primorial divisor Q | m. The terms in this sequence are the primitive quotients k = m/Q for m in A004490.

			a(1) = 1 since there are 2 colossally abundant numbers m that are primorials P, i.e., 2 and 6.
a(2) = 2 since 2 colossally abundant numbers m = 2P, i.e., 12 and 60.
a(3) = 4 since 120 = 4*30 is colossally abundant.
a(4) = 12 since 360 and 2520 = 12P, etc.
Table showing products of primorials in the column heading and terms in this sequence in the row headings that appear in A004490 (and in these cases, also A002201, thereby in their intersection, A224078).
          2   6   30    210    2310    30030      510510
  ------------------------------------------------------
    1:    2   6
    2:       12   60
    4:           120
   12:           360   2520
   24:                 5040   55440   720720
   48:                               1441440
  144:                               4324320
  720:                              21621600   367567200   ...
Textual plot of numbers at (n,k) where row n = a(n) and column k = A002110(k), marking terms (x) in A224078, (*) only in A004490, or (.) only in A002201.
   1: xx
   2:  xx
   3:   x
   4:   xx
   5:    xxx
   6:      x
   7:      x
   8:      xxx*
   9:        .x**
  10:         ..*
  11:          .x***
  12:           ...xx**
  13:               ..x****
  14:                     **
  15:                 ..   **
  16:                  .....***
  17:                      ...**********
  18:                        .....     ***
  19:                            ...     ****
  20:                              .....    ********
The largest term in A224078 = 581442729886633902054768000 = a(13)*A002110(17), so appears at (13,17).

Michael De Vlieger, Table of n, a(n) for n = 1..144
Michael De Vlieger, Annotated color-coded plot (x,y) = (a(n), A002110(j)) highlighting colossally abundant numbers in red. This sequence also can portray many but not all superior highly composite numbers (shown in blue). Terms in A224078 appear in black.
Michael De Vlieger, Simple extended color-coded plot (x,y) = (a(n), A002110(m)) showing 1000 terms of A004490 in red.

Cf. A002110, A004490, A025487, A073751, A301416, A305056, A307327.

Block[{s = Import["https://oeis.org/A073751/b073751.txt", "Data"][[All, -1]], a = 1, b = {}, k, m = 0}, Do[k = a*s[[i]]; If[# > m, m++] &@ PrimePi@ s[[i]]; Set[a, k]; AppendTo[b, k/Product[Prime[j], {j, m}]], {i, 120}]; Union@ b]

cp's OEIS Frontend

A332241 Indices of A224078(n) in A025487.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A166981 Superabundant numbers (A004394) that are highly composite (A002182).

Views

Author

Keywords

Comments

Links

Crossrefs

A304234 Superior highly composite numbers that are superabundant but not colossally abundant.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A304235 Colossally abundant numbers that are highly composite, but not superior highly composite.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A305056 a(n) = A004394(n)/A002110(A001221(A004394(n))).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A338786 Numbers in A166981 that are neither superior highly composite nor colossally abundant.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A340840 Union of the highly composite and superabundant numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A328549 1, together with the numbers that are simultaneously superior highly composite (A002201), colossally abundant (A004490), deeply composite (A095848), and miserable average divisor numbers (A263572).

Views

Author

Keywords

Comments

References

Crossrefs

A340014 Numbers k in A305056 such that k * A002110(j) is in A004394 for some j >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs