STATUS
reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
return m # Chai Wah Wu, Aug 02 2024
(Python)
from math import isqrt
from sympy import mobius, primepi
def A363597(n):
if n==1: return 1
def f(x): return n-1+sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))-primepi(x)
m, k = n-1, f(n-1)
while m != k:
m, k = k, f(k)
return m # Chai Wah Wu, Aug 02 2024
approved
editing
Michael De Vlieger, <a href="/A363597/b363597_1.txt">Table of n, a(n) for n = 1..10000</a>
proposed
approved
editing
proposed
(PARI) isok(k) = (k==1) || isprimepower(k) || !issquarefree(k); \\ Michel Marcus, Aug 24 2023
proposed
editing
editing
proposed