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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332621 a(n) = (1/n) * Sum_{k=1..n} n^(n/gcd(n, k)). 7
 1, 3, 19, 133, 2501, 15631, 705895, 8389641, 258280489, 4000040011, 259374246011, 2972033984173, 279577021469773, 4762288684702095, 233543408203327951, 9223372037928525841, 778579070010669895697, 13115469358498302735067, 1874292305362402347591139 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..386 FORMULA a(n) = [x^n] Sum_{k>=1} Sum_{j>=1} phi(j) * n^(j-1) * x^(k*j). a(n) = (1/n) * Sum_{k=1..n} n^(lcm(n, k)/k). a(n) = (1/n) * Sum_{d|n} phi(d) * n^d. a(n) = A332620(n) / n. MATHEMATICA Table[(1/n) Sum[n^(n/GCD[n, k]), {k, 1, n}], {n, 1, 19}] Table[(1/n) Sum[EulerPhi[d] n^d, {d, Divisors[n]}], {n, 1, 19}] Table[SeriesCoefficient[Sum[Sum[EulerPhi[j] n^(j - 1) x^(k j), {j, 1, n}], {k, 1, n}], {x, 0, n}], {n, 1, 19}] PROG (MAGMA) [(1/n)*&+[n^(n div Gcd(n, k)):k in [1..n]]:n in [1..20]]; // Marius A. Burtea, Feb 17 2020 (PARI) a(n) = sum(k=1, n, n^(n/gcd(n, k)))/n; \\ Michel Marcus, Mar 10 2021 CROSSREFS Cf. A000010, A056665, A130586, A226561, A228640, A308814, A321349, A332620. Sequence in context: A226459 A256092 A074567 * A091346 A305550 A035086 Adjacent sequences:  A332618 A332619 A332620 * A332622 A332623 A332624 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Feb 17 2020 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.

Last modified April 20 17:56 EDT 2021. Contains 343135 sequences. (Running on oeis4.)