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!)
A342617 a(n) = Sum_{d|n} phi(d)^(n-d+1). 1
1, 2, 3, 4, 5, 20, 7, 38, 135, 4102, 11, 1670, 13, 1679624, 4202505, 270346, 17, 60539912, 19, 4299292682, 470185508877, 1000000000012, 23, 17253793802, 4398046511125, 1283918464548878, 609359773564947, 131622174060806158, 29, 4789472952582154, 31 (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 - n/gcd(k,n)).
G.f.: Sum_{k>=1} phi(k) * x^k/(1 - (phi(k) * x)^k).
If p is prime, a(p) = p.
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[#]^(n - # + 1) &]; Array[a, 30] (* Amiram Eldar, Mar 17 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(d)^(n-d+1));
(PARI) a(n) = sum(k=1, n, eulerphi(n/gcd(k, n))^(n-n/gcd(k, n)));
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)*x^k/(1-(eulerphi(k)*x)^k)))
CROSSREFS
Sequence in context: A261639 A333993 A362064 * A329579 A024635 A217679
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 16 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 June 13 07:44 EDT 2024. Contains 373366 sequences. (Running on oeis4.)