|
|
A066218
|
|
Numbers k such that sigma(k) = Sum_{j|k, j<k} sigma(j).
|
|
24
|
|
|
198, 608, 11322, 20826, 56608, 3055150, 565344850, 579667086, 907521650, 8582999958, 13876688358, 19244570848, 195485816050, 255701999358, 1038635009650, 1410759512050
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
I propose this generalization of perfect numbers: for an arithmetical function f, the "f-perfect numbers" are the n such that f(n) = sum of f(k) where k ranges over proper divisors of n. The usual perfect numbers are i-perfect numbers, where i is the identity function. This sequence lists the sigma-perfect numbers. It is not hard to see that the EulerPhi-perfect numbers are the powers of 2 and the d-perfect numbers are the squares of primes (d(n) denotes the number of divisors of n).
Problems: Find an expression generating sigma-perfect numbers. Are there infinitely many of these? Find other interesting sets generated by other f's. 3.
|
|
LINKS
|
|
|
FORMULA
|
Integer n = p1^k1 * p2^k2 * ... * pm^km is in this sequence if and only if g(p1^k1)*g(p2^k2)*...*g(pm^km)=2, where g(p^k) = (p^(k+2)-(k+2)*p+k+1)/(p^(k+1)-1)/(p-1) for prime p and integer k>=1. - Max Alekseyev, Oct 23 2008
|
|
EXAMPLE
|
Proper divisors of 198 = {1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 99}; sum of their sigma values = 1 + 3 + 4 + 12 + 13 + 12 + 39 + 36 + 48 + 144 + 156 = 468 = sigma(198).
|
|
MATHEMATICA
|
f[ x_ ] := DivisorSigma[ 1, x ]; Select[ Range[ 1, 10^5 ], 2 * f[ # ] == Apply[ Plus, Map[ f, Divisors[ # ] ] ] & ]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|