An Interesting Pattern in the Prime Numbers: Parallax Compression
UPDATE - Saturday May 19<p>Join the Telegram group to discuss:
<a href="https://t.me/joinchat/G8AnchIna2q8yn1lGHirkA" rel="nofollow">https://t.me/joinchat/G8AnchIna2q8yn1lGHirkA</a><p>Note that Even and Odd Values of N have a very different pattern. For example try using the values 99 and 99, and then 100 and 100, in this HTML preview version:<p><a href="https://htmlpreview.github.io/?https://github.com/acmegeek/primes/blob/master/index.html?11" rel="nofollow">https://htmlpreview.github.io/?https://github.com/acmegeek/p...</a><p>Here is animation of increasing even values of N approaching GCD:  
<a href="https://streamable.com/l7r96" rel="nofollow">https://streamable.com/l7r96</a><p>CODE TO TRY:<p>Javascript
<a href="https://beta.observablehq.com/@montyxcantsin/unwinding-the-u.." rel="nofollow">https://beta.observablehq.com/@montyxcantsin/unwinding-the-u...</a>.<p>Mathematica
<a href="https://github.com/shaunxcode/a-pattern-in-the-primes" rel="nofollow">https://github.com/shaunxcode/a-pattern-in-the-primes</a><p>Perl
<a href="https://www.dropbox.com/s/z5tfub5geyuctex/prime-draw.pl?dl=0" rel="nofollow">https://www.dropbox.com/s/z5tfub5geyuctex/prime-draw.pl?dl=0</a><p>EXPLANATION:<p>In short, actually there are some curious patterns in this, and they are not simply equivalent to OEIS A054521 (as we, and others, initially thought they were).<p>For even values of n, they can be rendered by the GCD sequence, without the primality testing. But for odd values the pattern is different and GCD doesn't describe it.