OFFSET
1,2
COMMENTS
REFERENCES
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 3, p. 192.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..200
Chong-Yun Chao, Generalizations of theorems of Wilson, Fermat and Euler, Journal of Number Theory, Vol. 15, No. 1 (1982), pp. 95-114.
EXAMPLE
6 is a term since A002619(6) = 24 is divisible by 6.
MATHEMATICA
f[n_] := DivisorSum[n, EulerPhi[#]^2 * #^(n/#) * (n/#)! &]/n^2; Select[Range[1000], Divisible[f[#], #] &]
PROG
(Python)
from itertools import count, islice
from sympy import divisors, totient, factorial
def A349225_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n:not sum(totient(m:=n//d)**2*factorial(d)*m**d for d in divisors(n, generator=True)) % n**3, count(max(startvalue, 1)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Nov 11 2021
STATUS
approved