OFFSET
1,1
LINKS
L. J. Corwin, Irreducible polynomials over the integers which factor mod p for every p, Unpublished Bell Labs Memo, Sep 07 1967 [Annotated scanned copy]
PROG
(Python)
from sympy import primepi, integer_nthroot
def A278568(n):
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(n+x-1-sum(primepi(integer_nthroot(x, k)[0])-1 for k in range(1, x.bit_length())))
return bisection(f, n, n)<<1 # Chai Wah Wu, Feb 03 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 26 2016
STATUS
approved