OFFSET
1,2
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Length[e] == 1 || (Length[e] == 2 && Equal @@ e)]; Select[Range[100], q] (* Amiram Eldar, Apr 19 2025 *)
PROG
(PARI) is(n)=my(f=factor(n)[, 2]); #f<2 || (#f==2 && f[1]==f[2]) \\ Charles R Greathouse IV, Oct 19 2015
(Python)
from math import isqrt
from sympy import primepi, primerange, integer_nthroot
from oeis_sequences.OEISsequences import bisection
def A085156(n):
def f(x): return int(n+x-1+sum(((t:=primepi(s:=isqrt(y:=integer_nthroot(x, k)[0])))*(t-1)>>1)-sum(primepi(y//p) for p in primerange(s+1))-(primepi(y) if k&1 else 0) for k in range(1, x.bit_length())))
return bisection(f, n, n) # Chai Wah Wu, Jan 02 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jun 21 2003
STATUS
approved
