OFFSET
1,1
COMMENTS
t(n) = psi(n) - n is the sum of aliquot divisors of n, d, such that n/d is squarefree. Penney & Pomerance proposed a problem to show that the "pseudo-aliquot" sequence related to this function is unbounded. This sequence lists number with pseudo-aliquot sequence of cycle 2. The sequence that is analogous to perfect numbers is A033845.
The asymptotic density of the terms relative to the positive integers is zero. See Dimitrov link. - S. I. Dimitrov, Aug 06 2025
All terms are psi-abundant (A387893). Each term in the sequence has the same parity as its larger counterpart in A323330, which follows directly from psi(m) = psi(n) = m + n and the fact that psi(k) is even for k=>3. - S. I. Dimitrov, Sep 16 2025
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000
Kevin Brown and Charles Vanden Eynden, Pseudo-aliquot Sequences, Solution to Problem 10323, The American Mathematical Monthly, Volume 103, No. 8 (1996), pp. 697-698.
S. I. Dimitrov, On psi-amicable numbers and their generalizations, arXiv:2508.02318 [math.NT], 2025. See p. 2.
David E. Penney and Carl Pomerance, Problem 10323, The American Mathematical Monthly, Volume 100, No. 7 (1993), p. 688.
MATHEMATICA
psi[n_] := n*Times@@(1+1/Transpose[FactorInteger[n]][[1]]); t[n_]:= psi[n] - n; s={}; Do[n=t[m]; If[n>m && t[n]==m, AppendTo[s, m]], {m, 1, 120000}]; s
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jan 11 2019
STATUS
approved
