Fibonacci primes, primes of the form $2^n-k$ and beyond

TL;DR

This paper explores the distribution of primes within exponential and linear recurrence sequences, proposing a heuristic conjecture about their density and providing initial data comparisons.

Contribution

It introduces a new heuristic conjecture on the distribution of primes in recurrence sequences, extending prime prediction methods to these sequences.

Findings

Heuristic suggests either finitely many primes or a logarithmic density in recurrence sequences.

Comparison with limited data supports the conjecture's plausibility.

Provides approximations for the constant c_u related to prime density.

Abstract

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we guess that either there are only finitely many primes $u_n$, or else there exists a constant $c_u>0$ (which we can give good approximations to) such that there are $\sim c_u \log N$ primes $u_n$ with $n\leq N$, as $N\to \infty$. We compare our conjecture to the limited amount of data that we can compile.