OFFSET
1,2
COMMENTS
A perfect number n is defined by sigma(n) = 2n, so the value of i(n) = |sigma(n)-2n| measures the degree of perfection of n. The larger i(n) is, the more "imperfect" n is. I call the numbers n such that i(k) < i(n) for all k < n "highly-imperfect numbers".
RECORDS transform of |A033879|.
Initial terms are odd primes but then even numbers appear.
The last odd term is a(79) = 719. (Proof: sigma(27720n) >= 11080n, and so sigma(27720n) >= 4 * 27720(n + 1) for n >= 8, so there is no odd member of this sequence between 27720 * 8 and 27720 * 9, between 27720 * 9 and 2770 * 10, etc.; the remaining terms are checked by computer.) [Charles R Greathouse IV, Apr 12 2010]
LINKS
R. J. Mathar and Donovan Johnson, Table of n, a(n) for n = 1..1000 (first 238 terms from R. J. Mathar)
Joseph L. Pe, Puzzle 241. Highly imperfect primes, and answers, on C. Rivera's primepuzzles.net. [From M. F. Hasler, May 31 2009]
N. J. A. Sloane, Transforms
MATHEMATICA
r = 0; l = {}; Do[ n = Abs[2 i - DivisorSigma[1, i]]; If[n > r, r = n; l = Append[l, i]], {i, 1, 10^4}]; l
DeleteDuplicates[Table[{n, Abs[DivisorSigma[1, n]-2n]}, {n, 350}], GreaterEqual[ #1[[2]], #2[[2]]]&][[All, 1]] (* Harvey P. Dale, Jan 16 2023 *)
CROSSREFS
KEYWORD
easy,nice,nonn
AUTHOR
Joseph L. Pe, Oct 01 2002
STATUS
approved