OFFSET
1,1
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
Will Nicholes, Prime Signatures
MATHEMATICA
f[n_]:=Sort[Last/@FactorInteger[n]]=={1, 1, 5}; Select[Range[10000], f]
PROG
(PARI) list(lim)=my(v=List(), t); forprime(p=2, (lim\6)^(1/5), forprime(q=2, sqrt(lim\p^5), if(p==q, next); t=p^5*q; forprime(r=q+1, lim\t, if(p==r, next); listput(v, t*r)))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jul 20 2011
(Python)
from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def A179667(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 n+x+sum((t:=primepi(s:=isqrt(y:=x//r**5)))+(t*(t-1)>>1)-sum(primepi(y//k) for k in primerange(1, s+1)) for r in primerange(integer_nthroot(x, 5)[0]+1))+sum(primepi(x//p**6) for p in primerange(integer_nthroot(x, 6)[0]+1))-primepi(integer_nthroot(x, 7)[0])
return bisection(f, n, n) # Chai Wah Wu, Mar 27 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Joseph Stephan Orlovsky, Jul 23 2010
STATUS
approved
