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!)
A342423 a(n) = Sum_{k=1..n} gcd(k,n)^gcd(k,n). 10

%I #14 Mar 12 2021 09:10:43

%S 1,5,29,262,3129,46693,823549,16777484,387420549,10000003145,

%T 285311670621,8916100495490,302875106592265,11112006826381589,

%U 437893890380865741,18446744073726329368,827240261886336764193,39346408075296925089309

%N a(n) = Sum_{k=1..n} gcd(k,n)^gcd(k,n).

%H Seiichi Manyama, <a href="/A342423/b342423.txt">Table of n, a(n) for n = 1..386</a>

%F a(n) = Sum_{d|n} phi(n/d) * d^d.

%t a[n_] := Sum[GCD[k, n]^GCD[k, n], {k, 1, n}]; Array[a, 18] (* _Amiram Eldar_, Mar 11 2021 *)

%o (PARI) a(n) = sum(k=1, n, gcd(k, n)^gcd(k, n));

%o (PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*d^d);

%Y Cf. A000010, A332517, A342420, A342424.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Mar 11 2021

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 April 16 18:22 EDT 2024. Contains 371750 sequences. (Running on oeis4.)