In a previous log (More questions on gPEAC) I evoked a hunch I had but nothing was explained. I write this log to close this gap.

I suspect a mechanism that is somewhat similar to what I have seen with prime numbers, since I have studied algorithms (reverse sieves) to generate them. The common hints are

• a density that follows a logarithmic probability (to be determined for PEAC)
• Something to do with numbers moduli a prime number (2, 5 are identified)
• there are exclusion rules that have one exception, which is the very first occurrence.

From there it is possible to imagine a similar algorithm to detect which moduli are not going to give a perfect orbit.

I should try the sieve with other prime numbers, as already suggested in another log.