cp's OEIS Frontend

A375032 The maximum odd exponent in the prime factorization of n, or 0 if no such exponent exists.

%I A375032 #12 Aug 17 2024 09:16:25
%S A375032 0,1,1,0,1,1,1,3,0,1,1,1,1,1,1,0,1,1,1,1,1,1,1,3,0,1,3,1,1,1,1,5,1,1,
%T A375032 1,0,1,1,1,3,1,1,1,1,1,1,1,1,0,1,1,1,1,3,1,3,1,1,1,1,1,1,1,0,1,1,1,1,
%U A375032 1,1,1,3,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,3,1,1,1,1,1,1,1,5,1,1,1,0,1,1,1,3,1
%N A375032 The maximum odd exponent in the prime factorization of n, or 0 if no such exponent exists.
%C A375032 The asymptotic density of the occurrences of 0's is 0 (the asymptotic density of squares).
%C A375032 The asymptotic density of the occurrences of 1's is d(0) = Product_{p prime} (1 - 1/(p^2*(p+1))) = 0.881513... (A065465, asymptotic density of A335275).
%C A375032 The asymptotic density of the occurrences of 2*k+1, for k = 1, 2, ..., is d(k) = Product_{p prime} (1 - 1/(p^(2*k+2)*(p+1))) - Product_{p prime} (1 - 1/(p^(2*k)*(p+1))).
%H A375032 Amiram Eldar, <a href="/A375032/b375032.txt">Table of n, a(n) for n = 1..10000</a>
%H A375032 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A375032 max(a(n), A375033(n)) = A051903(n).
%F A375032 a(n) = 0 if and only if n is a square (A000290).
%F A375032 a(n) = 1 if and only if n is in A335275 \ A000290.
%F A375032 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=0} (2*k+1) * d(k) = 1.30000522546018852138..., where d(k) is defined in the Comments section above.
%F A375032 a(n) = A051903(A350389(n)). - _Amiram Eldar_, Aug 17 2024
%t A375032 a[n_] := Max[0, Max[Select[FactorInteger[n][[;; , 2]], OddQ]]]; a[1] = 0; Array[a, 100]
%o A375032 (PARI) a(n) = {my(e = select(x -> (x % 2), factor(n)[,2])); if(#e == 0, 0, vecmax(e));}
%Y A375032 Cf. A000290, A051903, A065465, A162642, A335275, A350389, A375033.
%K A375032 nonn,easy
%O A375032 1,8
%A A375032 _Amiram Eldar_, Jul 28 2024