|
%I #14 Nov 30 2023 02:53:03
%S 1,1,1,1,1,1,4,1,1,1,1,1,1,1,1,1,1,4,1,9,1,1,1,16,1,1,1,1,1,1,4,1,1,1,
%T 1,1,1,1,9,1,4,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,1,1,1,1,1,
%U 16,1,1,1,1,4,1,1,1,1,1,1,1,1,1,1,1,4,1
%N The exponentially odd numbers (A268335) divided by their squarefree kernels (A007947).
%C Analogous to A102631, with the exponentially odd numbers instead of the square numbers (A000290).
%C All the terms are square numbers.
%H Amiram Eldar, <a href="/A367418/b367418.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A003557(A268335(n)).
%F a(n) = A268335(n)/A367417(n).
%F a(n) = A367419(n)^2.
%F a(n) = A268335(n)^2/A367406(n).
%F a(n) = A008833(A268335(n)). - _Amiram Eldar_, Nov 30 2023
%t s[n_] := n / Times @@ FactorInteger[n][[;; , 1]]; s /@ Select[Range[200], AllTrue[FactorInteger[#][[;; , 2]], OddQ] &]
%o (PARI) b(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 2]%2, f[i, 1]^(f[i, 2]-1), 0)); }
%o lista(kmax) = {my(b1); for(k = 1, kmax, b1 = b(k); if(b1 > 0, print1(b1, ", "))); }
%Y Cf. A000290, A008833, A102631, A268335, A367406, A367417, A367419.
%K nonn,easy
%O 1,7
%A _Amiram Eldar_, Nov 17 2023
|
