This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064594 Nonunitary multiply perfect numbers: the sum of the nonunitary divisors of n is a multiple of n; i.e., n divides sigma(n) - usigma(n). 7
 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 24, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102, 103, 105, 106, 107, 109 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Trivially includes all squarefree numbers (A005117). See A064595 for the others. LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 MATHEMATICA nusigma[ n_ ] := DivisorSigma[ 1, n ]-Times@@(1+Power@@#&/@FactorInteger[ n ]); For[ n=1, True, n++, If[ Mod[ nusigma[ n ], n ]==0, Print[ n ] ] ] PROG (PARI) usigma(n)= { local(f, s=1); f=factor(n); for(i=1, matsize(f)[1], s*=1 + f[i, 1]^f[i, 2]); return(s) } { n=0; for (m=1, 10^9, if ((sigma(m) - usigma(m)) % m == 0, write("b064594.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Sep 19 2009 CROSSREFS Cf. A048146, A064591, A064592, A064593, A064595, A064596. Sequence in context: A122144 A064052 A248792 * A325511 A240370 A193304 Adjacent sequences:  A064591 A064592 A064593 * A064595 A064596 A064597 KEYWORD nonn,easy AUTHOR Dean Hickerson, Sep 25 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 01:32 EST 2019. Contains 330013 sequences. (Running on oeis4.)