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!)
A057791 Sum[k^(n-k)], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1. 0

%I #9 Oct 25 2019 21:14:33

%S 1,1,3,4,22,6,209,376,1835,2540,49863,94944,1151914,2190666,12079274,

%T 95722288,1150653920,3217888350,47454745803,130819911320,846278385786,

%U 8064305838350,126356632390297,288019285668096,6861189820377586

%N Sum[k^(n-k)], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.

%e a(8) = 1^7 + 3^5 + 5^3 + 7^1 = 376, since 1, 3, 5 and 7 are the positive integers relatively prime to 8 and <= 8.

%K nonn

%O 1,3

%A _Leroy Quet_, Nov 04 2000

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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)