cp's OEIS Frontend

A329613 Numbers k such that A071187(k) <> A329614(k).

%I A329613 #23 Feb 03 2024 10:13:24
%S A329613 324,1296,2500,5625,9604,10000,11664,20736,21609,38416,50625,58564,
%T A329613 60025,82944,90000,114244,131769,160000,194481,234256,236196,250000,
%U A329613 257049,334084,345744,360000,366025,456976,521284,614656,640000,714025,717409,751689,810000,944784,960400,1119364,1172889,1185921,1265625,1327104,1336336
%N A329613 Numbers k such that A071187(k) <> A329614(k).
%C A329613 All terms are squares; their square roots are in A329611.
%H A329613 David A. Corneth, <a href="/A329613/b329613.txt">Table of n, a(n) for n = 1..15072</a> (first 661 terms from Antti Karttunen, terms <= 10^14)
%H A329613 David A. Corneth, <a href="/A329613/a329613.gp.txt">PARI program</a>
%o A329613 (PARI)
%o A329613 A034386(n) = prod(i=1, primepi(n), prime(i));
%o A329613 A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) };  \\ From A108951
%o A329613 A071187(n) = if(1==n, n, my(f = factor(numdiv(n))); vecmin(f[, 1]));
%o A329613 A329614(n) = A071187(A108951(n));
%o A329613 k=0; n=0; while(n<2^16, n++; u = n*n; if(A071187(u)!=A329614(u), k++; write("b329613.txt", k, " ", u); print1(u,", ")));
%o A329613 (PARI) \\ See link
%Y A329613 Subsequence of A000290.
%Y A329613 Cf. A055932, A071187, A329611, A329614.
%K A329613 nonn
%O A329613 1,1
%A A329613 _Antti Karttunen_, Nov 18 2019