|
|
A109661
|
|
Numbers n such that the sum of the digits of phi(n)^n is divisible by n.
|
|
0
|
|
|
1, 9, 18, 23, 45, 172, 578, 4788, 6039, 6408, 10303
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Next term after 6408 is greater than 10000.
|
|
LINKS
|
|
|
EXAMPLE
|
The sum of the digits of phi(6039)^6039 is 42273 and 42273 is divisible by 6039, so 6039 is in the sequence.
|
|
MATHEMATICA
|
Do[s = EulerPhi[n]^n; k = Plus @@ IntegerDigits[s]; If[Mod[k, n] == 0, Print[n]], {n, 1, 10000}]
Select[Range[11000], Divisible[Total[IntegerDigits[EulerPhi[#]^#]], #]&] (* Harvey P. Dale, Oct 18 2014 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|