This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
Prime[Range[11]]^30 (* Vladimir Joseph Stephan Orlovsky, May 05 2011 *)
a(n)=prime(n)^30 \\ Charles R Greathouse IV, Jun 19 2016
Select[Range[9000000],DivisorSigma[0,#]==35&] (* Vladimir Joseph Stephan Orlovsky, May 06 2011 *)
is(n)=numdiv(n)==35 \\ Charles R Greathouse IV, Jun 19 2016
from sympy import primepi, integer_nthroot, primerange def A175745(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(primepi(integer_nthroot(x//p**6,4)[0]) for p in primerange(integer_nthroot(x,6)[0]+1))+primepi(integer_nthroot(x,10)[0])-primepi(integer_nthroot(x,34)[0]) return bisection(f,n,n) # Chai Wah Wu, Feb 22 2025
Select[Range[6000000],DivisorSigma[0,#]==34&] (* Vladimir Joseph Stephan Orlovsky, May 06 2011 *)
is(n)=numdiv(n)==34 \\ Charles R Greathouse IV, Jun 19 2016
from sympy import primepi, primerange, integer_nthroot def A175744(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-sum(primepi(x//p**16) for p in primerange(integer_nthroot(x,16)[0]+1))+primepi(integer_nthroot(x,17)[0])-primepi(integer_nthroot(x,33)[0])) return bisection(f,n,n) # Chai Wah Wu, Feb 22 2025
is(n)=numdiv(n)==32 && numdiv(n+1)==32
Comments