does this terminate? why are there copies in the bad root that function similarly to the main list
this is running (0,5)[5] where [n] grows at n+1 I guess this serves as a T12原始v1 demonstration what's so different about this and LPrSS? different bad root system, (1,2,2) turns into (1,2,1) and since no numbers <1 exists within this it pretty much clones the entire thing but due to the difference system it goes up by 1 every clone for some reason when I run (2,2)[2] with [n] being constant, the sequence simulated 2 different layers of bad roots I think unsure how to explain this and serves as the 99th project on this account how big does this grow? lower bound is f_phi(w,0)(n)and the upper is pair sequence system
