REVIEW
On a recursively defined sequence involving the prime counting function
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
On a recursively defined sequence involving the prime counting function
classification
math.NT
keywords
definedsequencebiglbigrcountingfunctioninvolvingprime
read the original 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).$
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.