Some properties of a sequence defined with the aid of prime numbers
Br\u{a}du\c{t} Apostol, Lauren\c{t}iu Panaitopol, Lucian Petrescu, and, L\'aszl\'o T\'oth

TL;DR
This paper studies a sequence defined via prime numbers, analyzing its properties and deriving asymptotic formulas for sums involving the sequence and related functions.
Contribution
It introduces and investigates the sequence where each term is the smallest positive integer making the sum with its index prime, providing new asymptotic results.
Findings
Asymptotic formulas for sums of the sequence and related functions
Behavior of the sequence as n grows large
Connections to prime number distribution
Abstract
For every integer let be the smallest positive integer such that is prime. We investigate the behavior of the sequence , and prove asymptotic results for the sums , and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms
