Conjectures on the recursively defined prime-counting sequence

Let (sn)n1(s_n)_{n\ge1} be the sequence defined in the paper, let an=snsn1a_n=s_n-s_{n-1} for n>1n>1, and for an integer b2b\ge2 define

A(b)=n1anbn.A(b)=\sum_{n\ge1}a_nb^{-n}.

The conjectures. (A) For every integer k0k\ge0, the set {n1:an=k}\{n\ge1:a_n=k\} has a positive density δk\delta_k, and

δ1>δ0>δ2>δ3>δ4>.\delta_1>\delta_0>\delta_2>\delta_3>\delta_4>\cdots.

(B) One has

lim infn(nsn)<.\liminf_{n\to\infty}(n-s_n)<\infty.

(C) For every integer b2b\ge2, the real number A(b)A(b) is transcendental. These conjectures describe the anticipated distribution and arithmetic nature of the increments of the recursively defined sequence; the preceding results establish only the limiting relations an/n0a_n/n\to0 and sn/n1s_n/n\to1, leaving (A)--(C) open.

Sources & referencesView supporting material

Primary source

Altug Alkan, Andrew R. Booker and Florian Luca, “On a recursively defined sequence involving the prime counting function”, arXiv:2006.08013 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.