cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A342019 Number of prime power divisors of the form p^p in the arithmetic derivative of A276086(n), the prime product form of primorial base expansion of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1
Offset: 1

Views

Author

Antti Karttunen, Mar 11 2021

Keywords

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, ...

Examples

			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.
		

Crossrefs

Cf. A001221, A003415, A003557, A129251, A276086, A327860, A342002, A342005, A342017, A342018 (positions of nonzero terms), A342026.

Programs

  • PARI
    A129251(n) = { my(f = factor(n)); sum(k=1, #f~, (f[k, 2]>=f[k, 1])); };
    A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
    A342019(n) = A129251(A327860(n));

Formula

a(n) = A129251(A327860(n)) = A129251(A342002(n)).
a(n) = A001221(A342017(n)).

A342016 Difference between the arithmetic derivative of A276086(n) and A276086(n) itself, which is the prime product form of primorial base expansion of n.

Original entry on oeis.org

-1, -1, -2, -1, -3, 3, -4, -3, -7, 1, -6, 33, -15, -5, -20, 35, 15, 255, -50, 25, -25, 325, 300, 1725, -125, 375, 250, 2375, 2625, 10875, -6, -5, -11, -1, -12, 39, -23, -11, -34, 37, 3, 321, -80, 15, -65, 395, 330, 2235, -225, 425, 200, 3025, 3225, 14325, -250, 3875, 3625, 20375, 24000, 87375, -35, -21, -56, 35, -21
Offset: 0

Views

Author

Antti Karttunen, Mar 04 2021

Keywords

Crossrefs

Programs

Formula

a(n) = A168036(A276086(n)) = A327860(n) - A276086(n).
For all n >= 0, gcd(a(n), A276086(n)) = gcd(a(n), A327860(n)) = A328572(n).
Showing 1-2 of 2 results.