The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325314 a(n) = n - A162296(n), where A162296(n) is the sum of divisors of n that have a square factor. 15

%I

%S 1,2,3,0,5,6,7,-4,0,10,11,-4,13,14,15,-12,17,-9,19,-4,21,22,23,-24,0,

%T 26,-9,-4,29,30,31,-28,33,34,35,-43,37,38,39,-32,41,42,43,-4,-9,46,47,

%U -64,0,-25,51,-4,53,-54,55,-40,57,58,59,-36,61,62,-9,-60,65,66,67,-4,69,70,71,-111,73,74,-25,-4,77,78,79,-88,-36,82,83

%N a(n) = n - A162296(n), where A162296(n) is the sum of divisors of n that have a square factor.

%H Antti Karttunen, <a href="/A325314/b325314.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A325314/a325314.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

%F a(n) = n - A162296(n).

%F a(n) = A033879(n) + A325313(n).

%F a(A228058(n)) = -A325320(n).

%t Array[# - DivisorSigma[1, #] + Times @@ (1 + FactorInteger[#][[;; , 1]]) - Boole[# == 1] &, 83] (* _Michael De Vlieger_, Jun 06 2019, after _Amiram Eldar_ at A162296 *)

%o (PARI)

%o A162296(n) = sumdiv(n, d, d*(1-issquarefree(d)));

%o A325314(n) = (n - A162296(n));

%Y Cf. A033879, A162296, A228058, A325313, A325315, A325320.

%K sign

%O 1,2

%A _Antti Karttunen_, Apr 21 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 10 04:49 EDT 2021. Contains 343748 sequences. (Running on oeis4.)