>>4005

Gonna have to better than that to kill the thread. There's just not that many people here, which is why every contribution is helpful.

>>4003

I've gone over that crumb a few times, but I don't know what to do with it because we still don't have a way of getting the NA we want. We know the answer is 25, and that the (N-1)A is 20, but we don't have a way to reach that answer. Maybe you could do some kind of Fourier transform but I don't know.

>>4006

If I had to guess, the medium sized moments would be an exponential growth formula which intersects with the factor cell.

The only note I have about F, is that any (E,D) with any values for (N,X,A,B) all have the same F. The inverse is true for any (F,D) with any (N,X,A,B) - they all have the same E.

>>4009

X ≈ floor(sqrt(abs(F)*(N)))

See my posts >>1929 >>1930 >>2346

>>4010

One of the problems with that approximately X formula is solved with this >>3962 >>3963 formula, i.e, working your way quickly down to the root cells.

>>4014

>exact for N2 (or F's N1), then X's variance sets in. Off by ~128 around ~N500 and grows, but was still less than 2000 at N5000.

It's more accurate for longer on higher E/F's because it's a prediction for that slope, not the A=1 cells.

>>4014

Sorry, didn't read which post you were replying to. It's a 100% accurate derivation of the next X in the chain.

>>4016

That formula is better suited for a way to brute force if an N contains any entries for any given E/F.

>>4015

I still haven't even started on the tree thing, I'm still working through all of the ideas I had while I was away. Honestly it doesn't make any sense to me at all right now, still processing it subconsciously I guess.

Finally debug'd my next big render. Here's a view of E to the right, N down. Red block, N is invalid. Yellow block, (E,N) has one X chain pattern. Blue block, # of X chains not equal to one.

Yellow block, X chain = 2. Blue block, else. Red block, invalid cell.

X Chain = 3.

X Chain = 4.

5.

Pay no attention to the man behind the curtain. X chain = 6.

>>4032

{1:1:2:1:1:5}

{1:1:8:3:5:13}

{1:1:18:5:13:25}

{1:1:32:7:25:41}

{1:1:50:9:41:61}

{1:1:72:11:61:85}

{1:1:98:13:85:113}

{1:1:128:15:113:145}

{1:1:162:17:145:181}

{1:1:200:19:181:221}

{1:1:242:21:221:265}

{1:1:288:23:265:313}

Here, B leads directly into the next cell's A. X Chain = 1.

{3:2:2:1:1:7}

{3:2:6:3:3:13}

{3:2:12:5:7:21}

{3:2:20:7:13:31}

{3:2:30:9:21:43}

{3:2:42:11:31:57}

{3:2:56:13:43:73}

{3:2:72:15:57:91}

{3:2:90:17:73:111}

{3:2:110:19:91:133}

{3:2:132:21:111:157}

{3:2:156:23:133:183}

Here, 2 different chains of cells lead from their B to their next cell's A. So X Chain(s) = 2. I'm calling them X chains because with the formula here, >>3962 (You) you only need one entry from each chain to unlock the entire chain.

>>4039

If you look at X Chain = 3, the first (E,N) is (0,9). Then (9,9). Then (18,9). Then (27,9). Basically (i9,9) for any i. The next row down is (27i,27) for any i. Then (0,45) (45 = 27+18). Every coord is a factor of 9, but not every factor of 9 is a coord.