Open Hash: time complexity of unsuccessful search

In the average case of unsuccessful search for an open hash, I don’t understand why in $ \sum_{i=0}^{\infty} α^{i}$ there is $ \infty$ ; shouldn’t it be the size of the table?