|
|
A333927
|
|
Recursive perfect numbers: numbers k such that A333926(k) = 2*k.
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Since a recursive divisor is also a (1+e)-divisor (see A049599), then the first 6 terms and other terms of this sequence coincide with those of A049603.
|
|
LINKS
|
|
|
EXAMPLE
|
264 is a term since the sum of its recursive divisors is 1 + 2 + 3 + 6 + 8 + 11 + 22 + 24 + 33 + 66 + 88 + 264 = 528 = 2 * 264.
|
|
MATHEMATICA
|
recDivQ[n_, 1] = True; recDivQ[n_, d_] := recDivQ[n, d] = Divisible[n, d] && AllTrue[FactorInteger[d], recDivQ[IntegerExponent[n, First[#]], Last[#]] &]; recDivs[n_] := Select[Divisors[n], recDivQ[n, #] &]; f[p_, e_] := 1 + Total[p^recDivs[e]]; recDivSum[1] = 1; recDivSum[n_] := Times @@ (f @@@ FactorInteger[n]); Select[Range[10^5], recDivSum[#] == 2*# &]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|