Can you surpass Γ0?
Can you make a function that grows faster than Feferman–Schütte ordinal (a.k.a. Γ0 or φ(1,0,0)) level in the fast growing hierarchy?
For those unfamiliar with what all the above gibberish means, I recommend watching Giroux Studios' video series on the fast growing hierarchy....
Given a positive integer n as input, output the reversed range sum of n.
A reversed range sum is created by making an inclusive range up to n, starting with 1 and including n, reversing each of the numbers inside, and summing it.
Example:
Here is what would happen for an input of 10:
Range: [...
cQuents, 4 bytes
;\r$
Try it online!
Explanation
Implicit input n.
; Series mode. Outputs the sum of the sequence from 1 to n.
\r$ Each item in the sequence equals:
\r String reverse of
$ current index (1-based)