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!)
A342433 a(n) = Sum_{k=1..n} gcd(k,n)^(n-1). 8
1, 3, 11, 74, 629, 8085, 117655, 2113796, 43059849, 1001955177, 25937424611, 743379914746, 23298085122493, 793811662313709, 29192938251553759, 1152956691126550536, 48661191875666868497, 2185928270773974154773 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

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

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

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

MATHEMATICA

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

PROG

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

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

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

CROSSREFS

Cf. A000010, A000272, A321349, A332517, A332621, A342432, A343510.

Sequence in context: A035378 A258387 A054461 * A203772 A290025 A239658

Adjacent sequences:  A342430 A342431 A342432 * A342434 A342435 A342436

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 July 29 14:43 EDT 2021. Contains 346346 sequences. (Running on oeis4.)