A351572 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A351572

Arithmetic derivative of the largest unitary divisor of n that is a square.

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

Antti Karttunen, Table of n, a(n) for n = 1..65537

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); };

A351572(n) = A003415(A350388(n));

CROSSREFS

Cf. A003415, A235992, A350388, A351570, A351573.

Sequence in context: A333979 A276580 A331437 * A108708 A290322 A274948

Adjacent sequences: A351569 A351570 A351571 * A351573 A351574 A351575

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 23 2022

STATUS

approved