login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A323310
List of e-unitary perfect numbers that are not e-semiproper perfect numbers.
3
4769856, 23849280, 52468416, 81087552, 90627264, 109706688, 138325824, 147865536, 176484672, 195564096, 205103808, 224183232, 252802368, 262342080, 281421504, 290961216, 319580352, 338659776, 348199488, 357739200, 376818624, 395898048, 405437760, 424517184
OFFSET
1,1
COMMENTS
The e-unitary perfect numbers are numbers k such that the sum of their exponential unitary divisors (A322857) equals 2k. The e-semiproper perfect numbers are numbers k such that the sum of their exponential semiproper divisors (A323309) equals 2k. Apparently most of the e-unitary perfect numbers are also e-semiproper perfect numbers: The first 41393 e-unitary perfect numbers are also the first 41393 e-semiproper perfect numbers, but the 41394th e-unitary perfect number is 4769856 which is not e-semiproper perfect. This number, which is the first term of this sequence, was found by Minculete.
LINKS
Nicusor Minculete, A new class of divisors: the exponential semiproper divisors, Bulletin of the Transilvania University of Brasov, Mathematics, Informatics, Physics, Series III, Vol. 7 No. 1 (2014), pp. 37-46.
MATHEMATICA
fs[p_, e_] := If[e==1, p, p^e + p]; a[1]=1; essigma[n_] := Times @@ fs @@@ FactorInteger[n]; esPerfectQ[n_] := essigma[n]==2n; fu[p_, e_] := DivisorSum[e, p^# &, GCD[#, e/#]==1 &]; eusigma[n_] := Times @@ fu @@@ FactorInteger[n]; euPerfectQ[n_] := eusigma[n] == 2n; aQ[n_] := euPerfectQ[n] && !esPerfectQ[n]; Select[Range[1, 10^8], aQ]
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jan 10 2019
STATUS
approved