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!)
A057792 Sum[k^k], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1. 1
1, 1, 5, 28, 288, 3126, 50069, 826696, 17604145, 388244060, 10405071317, 285312497280, 9211817190184, 303160805686506, 11415167261421900, 438197051187369424, 18896062057839751444, 827240565046755853710 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
a(4) = 1^1 + 3^3 = 28, since 1 and 3 are the positive integers <= 4 and relatively prime to 4.
PROG
(PARI) a(n) = sum(k=1, n, if (gcd(k, n)==1, k^k)); \\ Michel Marcus, Jun 19 2021
CROSSREFS
Sequence in context: A023887 A171187 A354899 * A338661 A174464 A372163
KEYWORD
nonn
AUTHOR
Leroy Quet, Nov 04 2000
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 May 13 14:28 EDT 2024. Contains 372519 sequences. (Running on oeis4.)