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!)
A326186 a(n) = n - A057521(n), where A057521 gives the powerful part of n. 2

%I #10 Nov 15 2022 02:37:23

%S 0,1,2,0,4,5,6,0,0,9,10,8,12,13,14,0,16,9,18,16,20,21,22,16,0,25,0,24,

%T 28,29,30,0,32,33,34,0,36,37,38,32,40,41,42,40,36,45,46,32,0,25,50,48,

%U 52,27,54,48,56,57,58,56,60,61,54,0,64,65,66,64,68,69,70,0,72,73,50,72,76,77,78,64,0,81,82,80,84

%N a(n) = n - A057521(n), where A057521 gives the powerful part of n.

%H Antti Karttunen, <a href="/A326186/b326186.txt">Table of n, a(n) for n = 1..20000</a>

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

%o (PARI)

%o A057521(n) = { my(f=factor(n)); prod(i=1, #f~, if(f[i, 2]>1, f[i, 1]^f[i, 2], 1)); }; \\ From A057521.

%o A326186(n) = (n-A057521(n));

%o (Python)

%o from math import prod

%o from sympy import factorint

%o def A326186(n): return n-n//prod(p for p, e in factorint(n).items() if e == 1) # _Chai Wah Wu_, Nov 14 2022

%Y Cf. A057521, A326185.

%Y Cf. also A010848.

%K nonn

%O 1,3

%A _Antti Karttunen_, Jul 11 2019

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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)