For all integers n ≥ 0, the ranges [243 + (n * 546)] to [249 + (n * 546)] inclusive appear to contain no prime numbers. Same with the ranges [297 + (n * 546)] to [303 + (n * 546)].
For both sets of ranges, the minimum gap between the closest neighbouring primes appears to be at least 10 (in decimal). Does anyone know of a number-theoretic explanation for this kind of pattern?
In a similar way 210=2*3*7*5 also gives wide empty columns (if you ignore ignore first row where 2,3,5,7 themselves are primes)
It helps if you think of it in terms of where the non primes are located instead of where the primes are. Multiples of 2, 3, 5 form a very regular pattern. Wrap it around in a grid and you get straight lines which are either straight vertical or slightly shifted depending on the divisors of width. Stack a couple of repetitive patterns and you still get a repetitive pattern. If the positions which are not primes form a regular pattern, the inverted image also forms recognizable pattern. Of course the primes don't form perfectly regular pattern and but most the visible repetition are result of small prime multiples.
It's a bit different workflow than what the adobe tooling provides and in no ways a replacement for adobe animation tooling, but for a more programmer oriented workflow especially if you are using sprite based graphics it's not bad.
There was also FlashDevelop and later HaxeDevelop as IDEs (.NET based) that integrated the corresponding tooling. Both seem currently unmaintained. If you are on windows you might still be able to run the old builds. Otherwise for non flash based projects the vscode haxe extension is quite good, but might need a bit more manual build scripts for the flash stuff compared to prime time of FlashDevelop.