%I #14 Oct 02 2024 12:25:35
%S 4,9,25,36,49,72,100,108,121,144,169,196,200,225,288,289,324,361,392,
%T 400,441,484,500,529,576,675,676,784,800,841,900,961,968,972,1089,
%U 1125,1152,1156,1225,1323,1352,1369,1372,1444,1521,1568,1600,1681,1764,1800
%N Numbers whose minimum prime exponent is 2.
%C Or barely powerful numbers, a subset of powerful numbers A001694.
%C The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions whose minimum multiplicity is 2 (counted by A244515).
%C Powerful numbers (A001694) that are not cubefull (A036966). - _Amiram Eldar_, Jan 30 2023
%H Amiram Eldar, <a href="/A325240/b325240.txt">Table of n, a(n) for n = 1..10000</a>
%F Sum_{n>=1} 1/a(n) = zeta(2)*zeta(3)/zeta(6) - Product_{p prime} (1 + 1/(p^2*(p-1))) = A082695 - A065483 = 0.6038122832... . - _Amiram Eldar_, Jan 30 2023
%e The sequence of terms together with their prime indices begins:
%e 4: {1,1}
%e 9: {2,2}
%e 25: {3,3}
%e 36: {1,1,2,2}
%e 49: {4,4}
%e 72: {1,1,1,2,2}
%e 100: {1,1,3,3}
%e 108: {1,1,2,2,2}
%e 121: {5,5}
%e 144: {1,1,1,1,2,2}
%e 169: {6,6}
%e 196: {1,1,4,4}
%e 200: {1,1,1,3,3}
%e 225: {2,2,3,3}
%e 288: {1,1,1,1,1,2,2}
%e 289: {7,7}
%e 324: {1,1,2,2,2,2}
%e 361: {8,8}
%e 392: {1,1,1,4,4}
%e 400: {1,1,1,1,3,3}
%t Select[Range[1000],Min@@FactorInteger[#][[All,2]]==2&]
%o (PARI) is(n)={my(e=factor(n)[,2]); n>1 && vecmin(e) == 2; } \\ _Amiram Eldar_, Jan 30 2023
%o (Python)
%o from math import isqrt, gcd
%o from sympy import integer_nthroot, factorint, mobius
%o def A325240(n):
%o def squarefreepi(n): return int(sum(mobius(k)*(n//k**2) for k in range(1, isqrt(n)+1)))
%o def bisection(f,kmin=0,kmax=1):
%o while f(kmax) > kmax: kmax <<= 1
%o while kmax-kmin > 1:
%o kmid = kmax+kmin>>1
%o if f(kmid) <= kmid:
%o kmax = kmid
%o else:
%o kmin = kmid
%o return kmax
%o def f(x):
%o c, l = n+x, 0
%o j = isqrt(x)
%o while j>1:
%o k2 = integer_nthroot(x//j**2,3)[0]+1
%o w = squarefreepi(k2-1)
%o c -= j*(w-l)
%o l, j = w, isqrt(x//k2**3)
%o c -= squarefreepi(integer_nthroot(x,3)[0])-l
%o for w in range(1,integer_nthroot(x,5)[0]+1):
%o if all(d<=1 for d in factorint(w).values()):
%o for y in range(1,integer_nthroot(z:=x//w**5,4)[0]+1):
%o if gcd(w,y)==1 and all(d<=1 for d in factorint(y).values()):
%o c += integer_nthroot(z//y**4,3)[0]
%o return c
%o return bisection(f,n,n**2) # _Chai Wah Wu_, Oct 02 2024
%Y Positions of 2's in A051904.
%Y Maximum instead of minimum gives A067259.
%Y Cf. A001221, A001222, A001358, A001694, A007774, A036966, A051903, A052485, A118914, A244515, A325241.
%Y Cf. A065483, A082695.
%K nonn
%O 1,1
%A _Gus Wiseman_, Apr 15 2019