User blog comment:MachineGunSuper/The Hyperfactorial Semi-Array notation/@comment-32783837-20180209214557

How to make this stronger:

Ϯ(n) = n!n!n!...!n!n!n with n "n"s ≈ fω+1(n)

Ϯ(a,b) = Ϯb(a) (superscript indicates recursion) ≈ fω+2(a)

Ϯ(a,b,c,...,x,y,z) = fz(1) where f(n) = Ϯ(a,b,c,...,x,y,n) ≈ fω+X(a) where X is the number of entries

Ϯ(a#b) = Ϯ(a,a,a,...,a,a,a) with b "a"s ≈ fω+b(a)

Ϯ(a##b) = Ϯ(a#a#a,...,a#a#a) with b "a"s ≈ fω2+1(a)

Ϯ(a#nb) = Ϯ(a#n-1a#n-1a,...,a#n-1a#n-1a) with b "a"s ≈ fω2+n-1(a)

Ϯ(a#2b) = Ϯ(a#ba) ≈ fω2+b-1(a)

Ϯ(a#3b) = Ϯ(a#2ba) ≈ fω3+b-1(a)

Ϯ(a#nb) = Ϯ(a#n-1ba) ≈ fωn+b-1(a)

limit: fω2(a), which still isn't that good considering this builds off a ω-level function