Search: id:A005100 Results 1-1 of 1 results found. %I A005100 M0514 %S A005100 1,2,3,4,5,7,8,9,10,11,13,14,15,16,17,19,21,22,23,25,26,27,29,31,32,33, %T A005100 34,35,37,38,39,41,43,44,45,46,47,49,50,51,52,53,55,57,58,59,61,62,63, %U A005100 64,65,67,68,69,71,73,74,75,76,77,79,81,82,83,85,86 %N A005100 Deficient numbers: numbers n such that sigma(n) < 2n. %C A005100 A number n is abundant if sigma(n) > 2n (cf. A005101), perfect if sigma(n) = 2n (cf. A000396), deficient if sigma(n) < 2n (this entry), where sigma(n) is the sum of the divisors of n (A000203). %C A005100 Also, numbers n such that A033630(n) = 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 02 2007 %D A005100 R. K. Guy, Unsolved Problems in Number Theory, B2. %D A005100 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005100 T. D. Noe, Table of n, a(n) for n = 1..10000 %H A005100 Walter Nissen, Abundancy : Some Resources %H A005100 J. Britton, Perfect Number Analyser %H A005100 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A005100 Eric Weisstein's World of Mathematics, Abundance %H A005100 Wikipedia, Deficient number %H A005100 Index entries for "core" sequences %p A005100 with(numtheory); s := proc(n) local i,j,ans; ans := [ ]; j := 0; for i while j