login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342432 a(n) = Sum_{k=1..n} gcd(k,n)^(n-2). 5
1, 2, 5, 22, 129, 1411, 16813, 266372, 4787349, 100391653, 2357947701, 61980047702, 1792160394049, 56707753687079, 1946197516142925, 72061992621375496, 2862423051509815809, 121441389759089405193, 5480386857784802185957 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..388

FORMULA

a(n) = Sum_{d|n} phi(n/d) * d^(n-2).

a(n) = Sum_{d|n} mu(n/d) * d * sigma_(n-3)(d).

a(n) ~ n^(n-2). - Vaclav Kotesovec, May 23 2021

MATHEMATICA

a[n_] := Sum[GCD[k, n]^(n - 2), {k, 1, n}]; Array[a, 20] (* Amiram Eldar, Mar 12 2021 *)

PROG

(PARI) a(n) = sum(k=1, n, gcd(k, n)^(n-2));

(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*d^(n-2));

(PARI) a(n) = sumdiv(n, d, moebius(n/d)*d*sigma(d, n-3));

CROSSREFS

Cf. A000010, A332517, A342412, A342433, A343510.

Sequence in context: A020093 A329260 A111542 * A246542 A001437 A067549

Adjacent sequences:  A342429 A342430 A342431 * A342433 A342434 A342435

KEYWORD

nonn

AUTHOR

Seiichi Manyama, Mar 12 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 01:39 EDT 2021. Contains 347504 sequences. (Running on oeis4.)