OFFSET
1,1
COMMENTS
All but two members of the sequence below 20000000 are the products of two primes separated by 6 or 16 and have digit sums of 25 or 26, which have proper divisor sums of 6 (=1+5) and 16(=1+2+13) respectively. The exceptions are the 1st term (57), which has a digit sum of 12 and the 67th (18999857), which has a digit sum of 56.
EXAMPLE
The divisors of 57 are 1, 3 and 19, so the difference of the two largest is 16.
The divisors of its digit sum (12=5+7) are 1,2,3,4 and 6, which also sum to 16.
MATHEMATICA
ok[n_] := Block[{d = Divisors@n, s = Total@ IntegerDigits@ n}, Length[d] > 2 && d[[-2]] - d[[-3]] == DivisorSigma[1, s] - s]; Select[Range[10^5], ok] (* Giovanni Resta, Jun 09 2015 *)
PROG
A program to test an individual integer, written in APL, is available if required.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Paul H. Smith (decisionbydesign(AT)aol.com), Nov 17 2007
STATUS
approved