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!)
A357210 a(n) = Sum_{k=1..n} prime(k/gcd(n,k)). 0

%I #23 Sep 23 2022 03:18:43

%S 2,4,7,11,19,22,43,46,66,68,131,90,199,158,187,223,383,242,503,320,

%T 441,478,793,436,824,716,879,734,1373,658,1595,1118,1313,1358,1579,

%U 1103,2429,1776,1957,1556,3089,1532,3449,2192,2347,2784,4229,2144,4134,2882,3687,3258,5591

%N a(n) = Sum_{k=1..n} prime(k/gcd(n,k)).

%C Inverse Moebius transform of A127413.

%F a(n) = Sum_{d|n} A127413(d).

%t Table[Sum[Prime[k/GCD[n, k]], {k, 1, n}], {n, 1, 53}]

%o (PARI) a(n) = sum(k=1, n, prime(k/gcd(n,k))); \\ _Michel Marcus_, Sep 20 2022

%Y Cf. A000040, A057661, A127413, A130029, A333558.

%K nonn

%O 1,1

%A _Ilya Gutkovskiy_, Sep 19 2022

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 August 30 03:24 EDT 2024. Contains 375523 sequences. (Running on oeis4.)