OFFSET
1,1
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
PROG
(PARI) is_A388984(k) = (!(k%2) && !isprimepower(k) && isprime(core(k)));
(PARI) is_A388984(k) = (!(k%2) && isprime(core(k)) && omega(k)>1);
(PARI)
up_to = 10000;
A388984list(up_to) = { my(v=vector(up_to), i=0); forstep(n=2, oo, 2, if(isprime(core(n)) && !isprimepower(n), i++; v[i] = n; if(i==up_to, return(v)))); };
v388984 = A388984list(up_to);
A388984(n) = v388984[n];
(Python)
from math import isqrt
from sympy import primepi
from oeis_sequences.OEISsequences import bisection
def A388984(n):
def f(x): return n+x-(isqrt(x>>1)+1>>1)-sum(primepi(x//y**2) for y in range(2, isqrt(x)+1, 2))+(x.bit_length()>>1)
return bisection(f, n, n) # Chai Wah Wu, Sep 25 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 22 2025
STATUS
approved
