login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A131605
Perfect powers of nonprimes (m^k where m is a nonprime positive integer and k >= 2).
34
1, 36, 100, 144, 196, 216, 225, 324, 400, 441, 484, 576, 676, 784, 900, 1000, 1089, 1156, 1225, 1296, 1444, 1521, 1600, 1728, 1764, 1936, 2025, 2116, 2304, 2500, 2601, 2704, 2744, 2916, 3025, 3136, 3249, 3364, 3375, 3600, 3844, 3969, 4225, 4356, 4624
OFFSET
1,2
COMMENTS
Although 1 is a square, is a cube, and so on..., 1 is sometimes excluded from perfect powers since it is not a well-defined power of 1 (1 = 1^k for any k in [2, 3, 4, 5, ...])
LINKS
PROG
(PARI) isok(n) = if (n == 1, return (1), return (ispower(n, , &np) && (! isprime(np)))); \\ Michel Marcus, Jun 12 2013
(Python)
from sympy import mobius, integer_nthroot, primepi
def A131605(n):
def f(x): return int(n-2+x+sum(mobius(k)*((a:=integer_nthroot(x, k)[0])-1)+primepi(a) for k in range(2, x.bit_length())))
kmin, kmax = 1, 2
while f(kmax) >= kmax:
kmax <<= 1
while True:
kmid = kmax+kmin>>1
if f(kmid) < kmid:
kmax = kmid
else:
kmin = kmid
if kmax-kmin <= 1:
break
return kmax # Chai Wah Wu, Aug 14 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Daniel Forgues, May 27 2008
EXTENSIONS
Klaus Brockhaus previously provided a table of n, a(n) for n=1..1323, May 28 2008
STATUS
approved