0,2

Sequence continues: a(30)=??, 31, 70, 112, 100, 57, 200, 37, 484, 55, 102, 41, 49, 43, a(44)=??, 94, 114, 47, 225, 1264, 252, 104, 294, 53, 780, 87, 71940, 118, 138, 59, 4290, 61, 1470, 85, 306, 134, a(66)=??, 67, 6300, 142, 288, 71, 324, 73, a(74)=??, 712, 174, 158, 2940, 79, a(80)=??, 166, 186, 83, 1344210, 405, 242, 115, 1590, 89, a(90)=??, 141, 196, 406, 540, 119, 2310, 97, 390, 202, 222, ..., . - Jason Earls (zevi_35711(AT)yahoo.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 12 2005

Smallest number N with perfect deficiency n, that is, the first number such that A109883(N)=n. - Walter A. Kehowski (wkehowski(AT)cox.net), Sep 13 2005

a(7) = 50: divisors of 50 are 1,2,5,10,25,..., 50-(1+2+5+10+25) = 7 and 50 is smallest such number.

with(numtheory); pdef := proc(n) local k, d, divd; d:=n; divd:=sort([op(divisors(n))]); for k in divd while d>=k do d:=d-k; od; end: PDL:=[]; for z from 1 to 1 do for pd from 0 to 60 do for n from 1 to 200000 do missed:=true; if pdef(n)=pd then PDL:=[op(PDL), n]; missed:=false; break fi od; if missed then PDL:=[op(PDL), -1] fi od od; PDL; (Kehowski)

subtract = If[ #1 < #2, Throw[ #1], #1 - #2]&; f[n_] := Catch @ Fold[subtract, n, Divisors @ n] (from Bobby R. Treat, (DrBob(AT)bigfoot.com), Jul 14 2005)

t = Table[0, {60}]; Do[ a = f[n]; If[a < 60 && t[[a + 1]] == 0, t[[a + 1]] = n], {n, 10^8}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 14 2005)

Cf. A109883, A109884, A064510.

Adjacent sequences: A109883 A109884 A109885 this_sequence A109887 A109888 A109889

Sequence in context: A141514 A078727 A076977 this_sequence A127615 A024631 A032814

nonn

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 11 2005

Corrected and extended by Jason Earls (zevi_35711(AT)yahoo.com), Jul 12 2005

More terms from Walter A. Kehowski (wkehowski(AT)cox.net), Sep 13 2005