Let b be an integer greater than 2, and let N_b = 1_b + 2_b + ... + 100_b (the sum contains all valid base b numbers up to 100_b). Compute the number of values b for which the sum of the squares of the base b digits of N_b is at most 512.
There are 37 possible values of b.
