The real treasure was the numbers we made along the way Your task is to write a program, function or snippet (yes, snippets are allowed) that simply outputs an integer. However, you must be able to separate your submission into prefixes that also produce distinct integers. You cannot use any bytes that have appeared in previous prefixes. For example, we can have the prefixes:

1         # 1    (Now we can't use 1)
1-6       # -5   (Now we can't use - or 6)
1-6/3     # -1   (Now we can't use / or 3)
1-6/3+0xA # 9    Final submission


Rules


Your goal is to create to try and create the most unique integers, while keeping them close to zero. 


The scoring system is ((number of unique integers)**3)/(sum of absolute values), where the higher your score, the better. The above example scores \$(4^3)/(1+\lvert-5\rvert+\lvert-1\rvert+9) = 64/16 = 4\$.

There should be at least two unique integers (no dividing by zero!)
Please format your answer similar to:


# Language, \$(4^{3})/16 = 4\$

   1-6/3+0xA (the full program)



Mention if your submission is composed of snippets that evaluate to a value, functions or full programs.
List each of the prefixes and (optionally) an explanation for how they work.
TI-BASIC (TI-84+ CE), \$238^3/14161 = 952.0\$

118-length("+×/ABCDEFGHIJK...


The 256 bytes in TI-BASIC break down thusly:


240 bytes are one-byte tokens that can be quoted
11 are the start of two-byte tokens
2 are unused
The remaining 3 are the ",→, and newline characters which break strings. 


The string contains all 237 allowable bytes in the first category not already in 118-length(.

The program calculates 238 distinct integers, ranging from 118 down to -119. The score is therefore $$ \frac{238^3}{\sum_{n = -119}^{118} |n|} = 952.$$