ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(1),a(2),…a(1),a(2),\ldots be the EKG sequence, the lexicographically earliest sequence of distinct positive integers satisfying

gcd⁡(a(n−1),a(n))>1for all n≥3.\gcd(a(n-1),a(n))>1 \quad\text{for all } n\geq 3.

Lagarias–Rains–Sloane conjecture. In the EKG sequence, if a(n)a(n) is neither a prime nor three times a prime, then

a(n)∼n(1+13log⁡n);a(n)\sim n\left(1+\frac{1}{3\log n}\right);

if a(n)a(n) is a prime, then

a(n)∼12n(1+13log⁡n);a(n)\sim \frac{1}{2}n\left(1+\frac{1}{3\log n}\right);

and if a(n)a(n) is 33 times a prime, then

a(n)∼32n(1+13log⁡n).a(n)\sim \frac{3}{2}n\left(1+\frac{1}{3\log n}\right).

The conjecture describes the three apparent asymptotic curves formed by the EKG sequence. It was attributed to Lagarias, Rains, and Sloane (2002) and is stated in the source as still open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.