cp's OEIS Frontend

A375931 The product of the prime powers in the prime factorization of n that have an exponent that is equal to the maximum exponent in this factorization.

%I A375931 #18 Apr 26 2025 20:07:45
%S A375931 1,2,3,4,5,6,7,8,9,10,11,4,13,14,15,16,17,9,19,4,21,22,23,8,25,26,27,
%T A375931 4,29,30,31,32,33,34,35,36,37,38,39,8,41,42,43,4,9,46,47,16,49,25,51,
%U A375931 4,53,27,55,8,57,58,59,4,61,62,9,64,65,66,67,4,69,70,71
%N A375931 The product of the prime powers in the prime factorization of n that have an exponent that is equal to the maximum exponent in this factorization.
%C A375931 Differs from A327526 at n = 12, 20, 28, 40, 44, 45, ... .
%C A375931 Each positive number appears in this sequence either once or infinitely many times:
%C A375931 1. If m is squarefree then the only solution to a(x) = m is x = m.
%C A375931 2. If m = s^k is a power of a squarefree number s with k >= 2, then x = m * i is a solution to a(x) = m for all numbers i that are k-free numbers (i.e., having exponents in their prime factorizations that are all less than k) that are coprime to m.
%H A375931 Amiram Eldar, <a href="/A375931/b375931.txt">Table of n, a(n) for n = 1..10000</a>
%F A375931 If n = Product_{i} p_i^e_i (where p_i are distinct primes) then a(n) = Product_{i} p_i^(e_i * [e_i = max_{j} e_j]), where [] is the Iverson bracket.
%F A375931 a(n) = A261969(n)^A051903(n).
%F A375931 a(n) = n / A375932(n).
%F A375931 a(n) = n if and only if n is a power of a squarefree number (A072774).
%F A375931 A051903(a(n)) = A051903(n).
%F A375931 omega(a(n)) = A362611(n).
%F A375931 omega(a(n)) = 1 if and only if n is in A356862.
%F A375931 Omega(a(n)) = A051903(n) * A362611(n).
%F A375931 a(n!) = A060818(n) for n != 3.
%F A375931 Sum_{k=1..n} a(k) ~ c * n^2, where c = 3/Pi^2 = 0.303963... (A104141).
%e A375931 180 = 2^2 * 3^2 * 5, and the maximum exponent in the prime factorization of 180 is 2, which is the exponent of its prime factors 2 and 3. Therefore a(180) = 2^2 * 3^2 = (2*3)^2 = 36.
%t A375931 a[n_] := Module[{f = FactorInteger[n], p, e, i, m}, p = f[[;; , 1]]; e = f[[;; , 2]]; m = Max[e]; i = Position[e, m] // Flatten; (Times @@ p[[i]])^m]; Array[a, 100]
%o A375931 (PARI) a(n) = {my(f = factor(n), p = f[,1], e = f[,2], m); if(n == 1, 1, m = vecmax(e); prod(i = 1, #p, if(e[i] == m, p[i], 1))^m);}
%Y A375931 Cf. A001221 (omega), A001222 (Omega), A005117, A051903, A060818, A072774, A104141, A261969, A327526, A356862, A362611, A375932.
%K A375931 nonn,easy
%O A375931 1,2
%A A375931 _Amiram Eldar_, Sep 03 2024