@engineer,
1) You're including distributions with empty bins, which means you're counting too many since all 37 numbers have to be used. Fixing this will make your answer even smaller.
2) You're not taking into account order of arrival. For instance (assuming 3 balls in bin 2), the 3 balls in bin 2 could have arrived there as the first 3 balls, the last 3 balls, or some other combination. There are C(100,3) ways those balls could have arrived in that bin. Fixing this will drastically increase your answer.
I wrote a Python script to count the number of 100-character strings that use all 37 characters of a 37-character alphabet. Here's an example with 5 spins of the wheel and 3 possible outcomes:
First, identify all partitions of 5 into 3 subsets:
a) 3 1 1
b) 2 2 1
Then determine all of the character permutations for each distribution:
a) 3!/(1!*2!) = 3 (because there is one 3 and two 1s in the distribution)
b) 3!/(2!*1!) = 3 (because there are two 2s and one 1 in the distribution)
Then, calculate the number of 5-character strings based on each distribution:
a) 5!/(3!*1!*1!) = 20
b) 5!/(2!*2!*1!) = 30
Finally, sum the a-products and the b-products to get 3*20 + 3*30 = 150.
Divide that by 3^5=243, which is the total number of possible outcomes to get 150/243.
FYI, there are 1,496,203 partitions of 100 into 37 subsets.