This question was reworked, please re-read it.
The ultrafactorials are a sequence of numbers which can be generated using the following function:
a(n) = n! ^ n!
Your task is to implement these numbers into your language. Your program will calculate the sum of all ultrafactorials from 0 up to inclusive
Your program may only take one input: a number, which resembles the last a(n) ultrafactorial to be added to the sum. The Input is assured to be positive or 0.
Your output is all up to you, as long as there's the visible sum of the numbers somewhere.
- You can assume all integers, therefore integer input, and using integer counting loops to produce some results.
Input: -1 Output: Any kind of error (because -1! is undefined), or no handling at all Input: 0 Output: 1 Input: 1 Output: 2 Input: 2 Output: 6 Input: 3 Output: 46662
This is code-golf, so the answer with the least length in bytes wins!