The simple algorithm shown in the uploaded file generates a nice grouping of primes under 105.
Is there a question there somewhere? I mean, what was your point in making this post?
I thought perhaps it might encourage someone to look for other algorithms that generate larger groupings. The algorithms could be described mathematically. Ultimately, my goal is to describe the nth prime!
I think that's a lost cause, there is no set of numbers which exclude prime number nth[next].
(Unless you decide to exclude it arbitrarily for such reasons as your computer is incapable of storing it.)
This is a known and unsolved problem in Mathematics today. Perhaps, once the Riemann Hypothesis is proven then out of it's proof will come a generating function for prime numbers. However, while we may fit selected groups of primes into some equation, there is no single equation that generates only prime numbers for any arbitrary size of primes.
Wait, you just arrange the numbers in some "nice" way, but you still have to know the prime numbers to fill that pattern? Where is the point? You are not using any property of prime numbers at all.
One could use any algorithm to arrange natural numbers, and subsequently look for identifiable patterns in resulting groups (or patterns) of primes. I did not claim to find a pattern. I only commented on a interesting group.
What is interesting? I just see a random arrangement.
Separate names with a comma.