[go: up one dir, main page]

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”).

A004085
Sum of digits of Euler totient function of n.
2
1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 1, 4, 3, 6, 8, 8, 7, 6, 9, 8, 3, 1, 4, 8, 2, 3, 9, 3, 10, 8, 3, 7, 2, 7, 6, 3, 9, 9, 6, 7, 4, 3, 6, 2, 6, 4, 10, 7, 6, 2, 5, 6, 7, 9, 4, 6, 9, 10, 13, 7, 6, 3, 9, 5, 12, 2, 12, 5, 8, 6, 7, 6, 9, 9, 4, 9, 6, 6, 15, 5, 9, 4, 10, 6, 10
OFFSET
1,3
LINKS
FORMULA
a(n) = A007953(A000010(n)). - Michel Marcus, Dec 18 2016
MAPLE
f:= n -> convert(convert(numtheory:-phi(n), base, 10), `+`):
map(f, [$1..100]); # Robert Israel, Dec 05 2017
MATHEMATICA
Total/@(IntegerDigits/@EulerPhi[Range[70]]) (* Harvey P. Dale, Jul 31 2013 *)
Table[Plus@@IntegerDigits@(EulerPhi[n]), {n, 100}] (* Vincenzo Librandi, Jun 01 2019 *)
PROG
(PARI) a(n) = sumdigits(eulerphi(n)); \\ Michel Marcus, Dec 18 2016
(Magma) [ &+Intseq(EulerPhi(n)): n in [1..100] ]; // Vincenzo Librandi, Jun 01 2019
CROSSREFS
KEYWORD
nonn,base
STATUS
approved