Erdős problem 770
For odd n, the values of h n form an unbounded set. This is described as 'easy to see' in [Er74b].
Sources
FormalConjectures/ErdosProblems/
770.lean
Retained formal statement
For every prime p, does the density of integers with h n = p exist?
sorry ↔ ∀ (p : ℕ), Nat.Prime p → ∃ a, {n | Erdos770.h n = ↑p}.HasDensity aOpenStatement only, no proof