OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
MAPLE
A:= select(t -> numtheory:-bigomega(t)=2, [seq(i, i=1..1000, 2)]):
B:= select(t -> numtheory:-bigomega(t)=2, [seq(i, i=2..1000, 2)]):
seq(op([A[i], B[i]]), i=1..min(nops(A), nops(B)));
PROG
(Python)
from math import isqrt
from sympy import primepi, primerange, prime
def A384940(n):
if n&1:
m = n+1>>1
def bisection(f, kmin=0, kmax=1):
while f(kmax) > kmax: kmax <<= 1
kmin = kmax >> 1
while kmax-kmin > 1:
kmid = kmax+kmin>>1
if f(kmid) <= kmid:
kmax = kmid
else:
kmin = kmid
return kmax
def f(x): return int(m+x+((t:=primepi(s:=isqrt(x)))*(t-1)>>1)-sum(primepi(x//k) for k in primerange(3, s+1)))
return bisection(f, m, m)
else:
return prime(n>>1)<<1 # Chai Wah Wu, Jun 17 2025
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Zak Seidov and Robert Israel, Jun 13 2025
STATUS
approved
