A082730 a(n) = smallest number k such that k - ms(k) = n, or 0 if no such number has been found, where ms(k) = sum of divisors of k other than k.

6, 1, 3, 0, 5, 9, 7, 50, 22, 0, 11, 244036, 13, 0, 27, 0, 17, 0, 19, 25, 46, 0, 23, 0, 124, 98, 58, 0, 29, 0, 31, 0, 250, 0, 57, 0, 37, 484, 55, 0, 41, 49, 43, 0, 94, 0, 47, 225, 1264, 0, 106, 0, 53, 0, 87, 0, 118, 0, 59, 0, 61, 2888, 85, 0, 134, 0, 67, 0, 142, 0, 71, 676, 73, 0

Offset: 0

Author

Amarnath Murthy, Apr 14 2003

Keywords

• nonn

Examples

			a(5) = 9 because the first 5 in A033879 is A033879(9).
		

Links

• F. Firoozbakht, M. F. Hasler, Variations on Euclid's formula for Perfect Numbers, JIS 13 (2010) #10.3.1

Crossrefs

Cf. A082731.

Cf. A001065, A033879.

Extensions

More terms from David Wasserman, Sep 29 2004, who remarks that he searched up to 10^16.