login

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”).

A341996
a(n) = 1 if there is at least one such prime p that p^p divides the arithmetic derivative of n, A003415(n); a(0) = a(1) = 0 by convention.
13
0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0
OFFSET
0
COMMENTS
Question: What is the asymptotic mean of this sequence and its complement A368915? See also A360111. - Antti Karttunen, Jan 11 2024
FORMULA
a(n) = [A327928(n)>0], where [ ] is the Iverson bracket.
For all n > 1, a(n) >= [A129251(n)>0], i.e., if A129251(n) is nonzero, then certainly a(n) = 1.
For all n >= 0, a(n) <= A341999(n).
For n > 0, a(n) = 1 - A368915(n). - Antti Karttunen, Jan 11 2024
PROG
(PARI)
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A129251(n) = { my(f = factor(n)); sum(k=1, #f~, (f[k, 2]>=f[k, 1])); };
A327928(n) = if(n<=1, 0, A129251(A003415(n)));
A341996(n) = (A327928(n)>0);
CROSSREFS
Characteristic function of A327929.
Positions of zeros is given by {0, 1} U A358215.
Differs from A327928 for the first time at n=81, where a(81)=1.
Sequence in context: A353814 A144596 A188187 * A341999 A118685 A244063
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 28 2021
STATUS
approved