Count everything that divides a number, add it all up, and a minority of integers come out ahead: this is abundance, sigma(n) > 2n. The list opens 12, 18, 20, 24, 30, 36, 40, 42, 48, ... — numbers whose divisors weigh more than the number itself.
Abundant Numbers Generator builds the full divisor-sum table with a sieve, then hands you any window of abundant numbers you ask for, each row carrying sigma(n) and the abundance excess. Start at the 57,000th abundant number if you like — the sieve makes every position equally fast.