|
|
A200758
|
|
Superimperfect numbers.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A number n is said to be superimperfect if 2*beta(beta(n)) = n, where beta is the multiplicative function defined by beta(p^e) = p^e - p^(e-1) + p^(e-2) - ... + (-1)^e for every prime power p^e. The function beta is called the alternating sum-of-divisors function. Here beta(n) is the absolute value of A061020(n). There are no other superimperfect numbers up to 10^7. The number 2^(2^k-1) is superimperfect if and only if k=1,2,3,4,5.
|
|
LINKS
|
|
|
PROG
|
(PARI) beta(n)=sumdiv(n, d, (-1)^bigomega(n/d)*d)
(PARI) ak(p, e)=my(s=1); for(i=1, e, s=s*p + (-1)^i); s
beta(n)=my(f=factor(n)); prod(i=1, #f~, ak(f[i, 1], f[i, 2]))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|