You can see that the pattern produced is different from the usual sierpinski, and the pattern seems to follow the pattern of pascal's triangle mod n, but despite the fact that this seems to be exactly halfway between the modulo 3 and 5 triangles the modulo 4 triangle does not actually give such a clean pattern. So what 1D rule is this one bound by, exactly?

This replicator generator (all credit to wwei):
[omitted]
You can see that the pattern produced is different from the usual sierpinski, and the pattern seems to follow the pattern of pascal's triangle mod n, but despite the fact that this seems to be exactly halfway between the modulo 3 and 5 triangles the modulo 4 triangle does not actually give such a clean pattern. So what 1D rule is this one bound by, exactly?

By slightly modifying the rule for that Pascal's Triangle replicator (specifically, subtracting B3j), I found an interesting rule with a failed replicator that can form spaceships and interesting guns.

Very interesting to see how there are two separate mechanisms to move each block by (2,1), both involving complex interactions. [ The first being a complex (2,1) move and the second being (0,-1) followed by (2,2) ]

The latest version of the 5S Project contains over 226,000 spaceships. There is also a GitHub mirror of the collection. Tabulated pages up to period 160 (out of date) are available on the LifeWiki.

This rulespace (matching the first 29 generations) contains an object that creates four copies of itself in the back, heading out in all directions, whilst preserving itself. This makes it failedrep with irregular behavior, though the exact behavior depends on the rule. The engine tends to be relatively stable, so most rules either peter out or are quickly dominated by an explosion of B-like objects.

None of the following are generators of any replicators I have made generators for yet, these are optimizations of old generators. That being said, they are pretty extreme optimizations, each shortening the RLE of the original generator by over 50000 characters.