The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342487 a(n) = Sum_{d|n} phi(d)^(n+1). 5
1, 2, 17, 34, 4097, 258, 1679617, 262658, 60467201, 8388610, 1000000000001, 67133442, 1283918464548865, 940369969154, 281479271743489, 2251816993685506, 4722366482869645213697, 1218719481069570, 12748236216396078174437377, 9223380832949895170 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{k=1..n} phi(n/gcd(k, n))^n.
G.f.: Sum_{k>=1} phi(k)^(k+1) * x^k/(1 - (phi(k) * x)^k).
If p is prime, a(p) = 1 + (p-1)^(p+1).
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[#]^(n+1) &]; Array[a, 20] (* Amiram Eldar, Mar 14 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(d)^(n+1));
(PARI) a(n) = sum(k=1, n, eulerphi(n/gcd(k, n))^n);
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)^(k+1)*x^k/(1-(eulerphi(k)*x)^k)))
CROSSREFS
Sequence in context: A284779 A018529 A342485 * A342613 A041031 A041965
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 13 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 18:37 EDT 2024. Contains 372664 sequences. (Running on oeis4.)