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!)
A345279 a(n) = Sum_{p|n} p^((pi(p)+1) mod 2). 1

%I #3 Jun 12 2021 22:12:11

%S 0,1,3,1,1,4,7,1,3,2,1,4,13,8,4,1,1,4,19,2,10,2,1,4,1,14,3,8,29,5,1,1,

%T 4,2,8,4,37,20,16,2,1,11,43,2,4,2,1,4,7,2,4,14,53,4,2,8,22,30,1,5,61,

%U 2,10,1,14,5,1,2,4,9,71,4,1,38,4,20,8,17,79,2,3,2,1,11,2,44

%N a(n) = Sum_{p|n} p^((pi(p)+1) mod 2).

%e a(15) = Sum_{p|15} p^((pi(p)+1) mod 2) = 3^1 + 5^0 = 4.

%t Table[Sum[k^Mod[PrimePi[k] + 1, 2] (PrimePi[k] - PrimePi[k - 1]) (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 100}]

%Y Cf. A000720 (pi), A345278.

%K nonn

%O 1,3

%A _Wesley Ivan Hurt_, Jun 12 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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)