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!)
A351572 Arithmetic derivative of the largest unitary divisor of n that is a square. 3
0, 0, 0, 4, 0, 0, 0, 0, 6, 0, 0, 4, 0, 0, 0, 32, 0, 6, 0, 4, 0, 0, 0, 0, 10, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 60, 0, 0, 0, 0, 0, 0, 0, 4, 6, 0, 0, 32, 14, 10, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 6, 192, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 10, 4, 0, 0, 0, 32, 108, 0, 0, 4, 0, 0, 0, 0, 0, 6, 0, 4, 0, 0, 0, 0, 0, 14, 6, 140 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
All terms are even: see comments in A235992 and observe that the terms of A350388 are all either odd or multiples of 4.
LINKS
FORMULA
a(n) = A003415(A350388(n)).
MATHEMATICA
f1[p_, e_] := If[EvenQ[e], p^e, 1]; f2[p_, e_] := If[EvenQ[e], e/p, 0]; a[1] = 0; a[n_] := (Times @@ f1 @@@ (f = FactorInteger[n]))*(Plus @@ f2 @@@ f); Array[a, 100] (* Amiram Eldar, Feb 23 2022 *)
PROG
(PARI)
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A350388(n) = { my(m=1, f=factor(n)); for(k=1, #f~, if(0==(f[k, 2]%2), m *= (f[k, 1]^f[k, 2]))); (m); };
CROSSREFS
Sequence in context: A333979 A276580 A331437 * A108708 A290322 A274948
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 23 2022
STATUS
approved

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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)