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-2 of 2 results.

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

Views

Author

N. J. A. Sloane, Oct 20 2019

Keywords

Comments

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

References

Crossrefs

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

A356573 Sigma-dense numbers: integers k such that sigma(k) * log(1+log(1+log(1+k))) / (k * log(1+log(1+k))) sets a new record.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 60, 120, 240, 360, 720, 840, 1260, 1680, 2520, 5040, 10080, 15120, 27720, 55440, 110880, 166320, 277200, 332640, 554400, 720720, 1441440, 2162160, 3603600, 4324320, 7207200, 10810800, 21621600, 36756720, 61261200, 73513440, 122522400, 183783600
Offset: 1

Views

Author

Hal M. Switkay, Dec 11 2022

Keywords

Comments

This sequence is to A210594 (the generalization in the latter's comment section) as sigma (A000203, the sum of divisors function) is to tau (A000005, the number of divisors function).

Crossrefs

Programs

  • Mathematica
    s={}; dm = 0; Do[If[(d = DivisorSigma[1, n] * Log[1 + Log[1 + Log[1 + n]]] / (n * Log[1 + Log[1 + n]])) > dm, dm = d; AppendTo[s, n]], {n, 1, 10^5}]; s (* Amiram Eldar, Dec 12 2022 *)
  • PARI
    listas(nn) = {my(m=0); for (k=1, nn, my(mm = sigma(k)*log(1+log(1+log(1+k))) / (k * log(1+log(1+k)))); if (mm > m, print1(k, ", "); m = mm); ); } \\ Michel Marcus, Dec 12 2022

Extensions

a(22)-a(31) from Michel Marcus, Dec 12 2022
a(32)-a(38) from Amiram Eldar, Dec 12 2022
Showing 1-2 of 2 results.