Formal target: Corpus.OEIS96535.conjecture

All numbers appear infinitely often, i.e., for every number $k \ge 0$ and every frequency $f > 0$ there is an index $i$ such that $a(i) = k$ is the $f$-th occurrence of $k$ in the sequence.

Exact formal statement

∀ (k N : Nat), Exists.{1} fun i => And (GT.gt.{0} i N) (Eq.{1} (Corpus.OEIS96535.a i) k)

This target is a formal statement, not a proof of the problem.

Environment availability: available.

Public accepted solutions (paginated API)

Public JSON record