cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

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

Views

Author

T. D. Noe, Oct 26 2009

Keywords

Comments

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)

Crossrefs

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

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

Views

Author

Michael De Vlieger, May 08 2018

Keywords

Comments

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.

Crossrefs

Programs

  • Mathematica
    (* 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, #] &]]

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

Views

Author

Michael De Vlieger, Nov 09 2020

Keywords

Comments

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.

Examples

			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.
		

Crossrefs

Programs

  • Mathematica
    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 *)

Formula

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

Views

Author

Michael De Vlieger, Jan 27 2021

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    (* 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]]
Showing 1-4 of 4 results.