On a recursively defined sequence involving the prime counting function

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.08013 v1 pith:G3MWQZYO submitted 2020-06-14 math.NT

Altug Alkan , Andrew R. Booker , Florian Luca This is my paper · ORCID

classification math.NT

keywords definedsequencebiglbigrcountingfunctioninvolvingprime

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

abstract

We prove some properties of the sequence $\{a_n\}_{n\ge1}$ defined by $a_n=\pi(n)-\pi\bigl(\textstyle\sum_{k=1}^{n-1}a_k\bigr).$