login

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”).

A303661
Powers of squarefree semiprimes that are not squarefree.
3
36, 100, 196, 216, 225, 441, 484, 676, 1000, 1089, 1156, 1225, 1296, 1444, 1521, 2116, 2601, 2744, 3025, 3249, 3364, 3375, 3844, 4225, 4761, 5476, 5929, 6724, 7225, 7396, 7569, 7776, 8281, 8649, 8836, 9025, 9261, 10000, 10648, 11236, 12321, 13225, 13924, 14161, 14884
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Squarefree.
Eric Weisstein's World of Mathematics, Semiprime.
FORMULA
Sum_{n>=1} 1/a(n) = Sum_{n>=1} 1/((A006881(n)-1)*A006881(n)) = Sum_{k>=2} (P(k)^2 - P(2*k))/2 = 0.07160601536406295068..., where P(k) is the prime zeta function. - Amiram Eldar, Feb 12 2021
EXAMPLE
1089 is in the sequence because 1089 = 3^2*11^2.
1296 is in the sequence because 1296 = 2^4*3^4.
MATHEMATICA
Select[Range[15000], Length[Union[FactorInteger[#][[All, 2]]]] == 1 && PrimeNu[#] == 2 && ! SquareFreeQ[#] &]
seq[max_] := Module[{sp = Select[Range[Floor@Sqrt[max]], SquareFreeQ[#] && PrimeNu[#] == 2 &], s = {}}, Do[s = Join[s, sp[[k]]^Range[2, Floor@Log[sp[[k]], max]]], {k, 1, Length[sp]}]; Union@s]; seq[10000] (* Amiram Eldar, Feb 12 2021 *)
PROG
(Python)
from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def A303661(n):
def g(x): return int(-(t:=primepi(s:=isqrt(x)))-(t*(t-1)>>1)+sum(primepi(x//k) for k in primerange(1, s+1)))
def f(x): return n-1+x-sum(g(integer_nthroot(x, k)[0]) for k in range(2, x.bit_length()))
kmin, kmax = 1, 2
while f(kmax) >= kmax:
kmax <<= 1
while True:
kmid = kmax+kmin>>1
if f(kmid) < kmid:
kmax = kmid
else:
kmin = kmid
if kmax-kmin <= 1:
break
return kmax # Chai Wah Wu, Aug 19 2024
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 28 2018
STATUS
approved