Mathematics of Form: Recursive Forms with Ordered Fusion and Replicative Propagation

We introduce a recursively generated combinatorial class built from a primitive unit, ordered binary fusion, and a unary propagation operator that replicates weight by a factor of three. Fusion combines two ordered forms by adding their weights, while propagation triples the weight of a form without erasing its underlying structure. We derive the coefficient recurrence and the generating-function equation F(x)=x+F(x)^2+F(x^3), establish the resulting square-root asymptotic behavior, and develop structural results concerning resolution, weight, and distinct forms of equal weight. We also generalize the construction to a propagation factor q\\ge2, providing a broader family of self-substitution functional equations and recursive combinatorial classes.