User blog comment:MilkyWay90/Generalized Factorial Function/@comment-35392788-20180517135333/@comment-31966679-20180522221956

"Has this been discovered before? Most likely not." Thank you for the confirmation. I asked this because my lvl function has already been discovered before (addition, multiplication, exponentiation, tetration, penetration, etcetera.), the exponential factorial has been discovered before, etc.

"What is the growth rate of this function? We can't answer this like that, ..." I meant for examples like A(n, !) or BB(n, !)

Also, here is my idea for F(!, n):

F(!, 1) = 1

F(!, n) = F(F(!, n - 1), n).

For an array notation:

F(1, 1, ..., !, 1, 1, ...) = 1

F(a, b, ..., !, c, d, ...) = F(a, b, ..., F(a - 1, b - 1, ..., !, c - 1, d , ...), c, d, ...)

Can you give examples of this notation put into functions growth rate? (Like BEAF)