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!)
A344461 a(n) = Sum_{d|n} d^gcd(d,n/d). 0

%I #4 May 19 2021 23:51:20

%S 1,3,4,9,6,12,8,29,37,18,12,60,14,24,24,341,18,273,20,134,32,36,24,

%T 236,3151,42,784,240,30,72,32,4645,48,54,48,48789,38,60,56,574,42,96,

%U 44,548,3462,72,48,21740,823593,103203,72,750,54,6888,72,1072,80,90,60,1160

%N a(n) = Sum_{d|n} d^gcd(d,n/d).

%C If p is prime, a(p) = Sum_{d|p} d^gcd(d,p/d) = 1^1 + p^1 = p + 1.

%e a(8) = Sum_{d|8} d^gcd(d,8/d) = 1^1 + 2^2 + 4^2 + 8^1 = 29.

%t Table[Sum[k^GCD[k, n/k] (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 80}]

%Y Cf. A055155, A337180.

%K nonn

%O 1,2

%A _Wesley Ivan Hurt_, May 19 2021

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 July 23 12:16 EDT 2024. Contains 374549 sequences. (Running on oeis4.)