Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Feb 03 2024 10:13:24
%S 324,1296,2500,5625,9604,10000,11664,20736,21609,38416,50625,58564,
%T 60025,82944,90000,114244,131769,160000,194481,234256,236196,250000,
%U 257049,334084,345744,360000,366025,456976,521284,614656,640000,714025,717409,751689,810000,944784,960400,1119364,1172889,1185921,1265625,1327104,1336336
%N Numbers k such that A071187(k) <> A329614(k).
%C All terms are squares; their square roots are in A329611.
%H 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 David A. Corneth, <a href="/A329613/a329613.gp.txt">PARI program</a>
%o (PARI)
%o A034386(n) = prod(i=1, primepi(n), prime(i));
%o A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951
%o A071187(n) = if(1==n, n, my(f = factor(numdiv(n))); vecmin(f[, 1]));
%o A329614(n) = A071187(A108951(n));
%o 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 (PARI) \\ See link
%Y Subsequence of A000290.
%Y Cf. A055932, A071187, A329611, A329614.
%K nonn
%O 1,1
%A _Antti Karttunen_, Nov 18 2019