OFFSET
1,1164
COMMENTS
When considering the iterations of the arithmetic derivative (i.e., of map x -> A003415(x)) and where such process will eventually end, it is known that any divisor of the form p^p (with p prime) in x guarantees that instead of ever reaching zero, it will either get stuck at a fixed point (of the form p^p) or diverge forever towards infinity (see, e.g., Ufnarovski and Åhlander paper). Because such (new) "doom divisors" are born only in the "wild part" of the arithmetic derivative (i.e., what is left after A003557(n) has been divided out of the derivative of n), it follows that when the derivative is applied to terms of A276086 (that do not contain any doom divisors), the count of such divisors in the result must be equal to that for A342002(n).
Positions of the records (and the first occurrence of each n) start as: 1, 8, 1164, 18675300, ...
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537
Victor Ufnarovski and Bo Åhlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003, #03.3.4.
EXAMPLE
For n=108, A342002(108) = 36 = 2^2 * 3^2. Only the first prime power divisor is of the form p^p, thus a(108) = 1. Note that A276086(108) = A003415(42875) = 42875 = 5^3 * 7^3, and A327860(108) = 44100 = 2^2 * 3^2 * 5^2 * 7^2. The same "doom divisors" are always found both in A327860(n) and in A342002(n).
For n=1164, A342002(1164) = 648 = 2^3 * 3^4. In both prime power divisors the exponent attains its base prime (3 >= 2 and 4 >= 3), thus a(1164) = 2. Note that A276086(1164) = 34525308125 = 5^4 * 7^3 * 11^5, and A327860(1164) = 58110129000 = 2^3 * 3^4 * 5^3 * 7^2 * 11^4.
For n=18675300, A342002(18675300) = 3037500 = 2^2 * 3^5 * 5^5. Here all three prime power divisors are "doom divisors" because they reach the p^p limit, thus a(18675300) = 3.
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 11 2021
STATUS
approved