OFFSET
1,1
COMMENTS
Let A(n), n>=1, be an infinite positive sequence.
We call a number n:
A-deficient if Sum{d|n, d<n} A(d) < A(n),
A-abundant if Sum{d|n, d<n} A(d) > A(n),
and
A-perfect if Sum{d|n, d<n} A(d) = A(n),
depending on the sum over the proper divisors of n.
The definition generalizes the standard nomenclature of deficient (A005100), abundant (A005101) and perfect numbers (A000396), which is recovered by setting A(n) = n = A000027(n).
Conjecture: if there exist infinitely many A-deficient numbers and infinitely many A-abundant numbers, then there exist infinitely many A-perfect numbers.
Note that the sequence contains squares of all Fermat primes larger than 3 (see A019434). [This would also hold for squares of any hypothetical Fermat primes after the fifth one, 65537. Comment clarified by Antti Karttunen, May 14 2015]
A192895(a(n)) = 0. - Reinhard Zumkeller, Jul 12 2011
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Reinhard Zumkeller)
EXAMPLE
MATHEMATICA
binw[n_] := DigitCount[n, 2, 1]; Select[Range[1500], binw[#] == DivisorSum[#, binw[#1] &]/2 &] (* Amiram Eldar, Dec 14 2020 *)
PROG
(Sage) A000120 = lambda x: x.digits(base=2).count(1)
# D. S. McNeil, Dec 04 2010
(Haskell)
import Data.List (elemIndices)
a175522 n = a175522_list !! (n-1)
a175522_list = map (+ 1) $ elemIndices 0 a192895_list
-- Reinhard Zumkeller, Jul 12 2011
(PARI) is(n)=sumdiv(n, d, hammingweight(d))==2*hammingweight(n) \\ Charles R Greathouse IV, Jan 28 2016
(Python)
from sympy import divisors
def A000120(n): return bin(n).count('1')
def aupto(limit):
alst = []
for m in range(1, limit+1):
return alst
print(aupto(1563)) # Michael S. Branicky, Feb 25 2021
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Dec 03 2010
EXTENSIONS
More terms from Amiram Eldar, Feb 18 2019
STATUS
approved