proposed
approved
proposed
approved
editing
proposed
return c # Chai Wah Wu, Sep 10 2024
(Python)
from math import gcd
from sympy import prime, integer_nthroot, factorint
def A258600(n):
c, m = 0, prime(n)**3
for w in range(1, integer_nthroot(m, 5)[0]+1):
if all(d<=1 for d in factorint(w).values()):
for y in range(1, integer_nthroot(z:=m//w**5, 4)[0]+1):
if gcd(w, y)==1 and all(d<=1 for d in factorint(y).values()):
c += integer_nthroot(z//y**4, 3)[0]
return c # Chai Wah Wu, Sep 10 2024
approved
editing
Amiram Eldar, <a href="/A258600/b258600_1.txt">Table of n, a(n) for n = 1..1000</a>
reviewed
approved
proposed
reviewed
editing
proposed
Also the index smallest number m such that A258568(m) = prime(n):
Also smallest number the index m such that A258568(m) = prime(n):