math.CO/0409509 number 46

[rwst]

What is the conjecture

Define $\varsigma(n)$ the smallest prime factor of $n$. Let $a_n$ the least number such that the number of numbers $k\le a_n$ with $k>\varsigma(k)^n$ exceeds the number of numbers with $k\le\varsigma(k)^n$. Then $a_n = 3^n + 3\cdot2^n + 6.$

See https://oeis.org/A087719

Prerequisites needed

Status: open

Choose either option

• I plan on adding this conjecture to the repository
• This issue is up for grabs: I would like to see this conjecture added by somebody else