OFFSET
1,1
COMMENTS
Proper subset of A126706.
Starts to differ from A317616 at a(4071). - R. J. Mathar, Nov 02 2025
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
EXAMPLE
Table of n, a(n) for select n:
n a(n)
----------------------------
1 12 = 2^2 * 3
2 18 = 2 * 3^2
3 20 = 2^2 * 5
4 24 = 2^3 * 3
5 28 = 2^2 * 7
6 40 = 2^3 * 5
7 44 = 2^2 * 11
8 45 = 3^2 * 5
9 48 = 2^4 * 3
38 144 = 2^4 * 3^2 = 12^2
99 324 = 2^2 * 3^4 = 18^2
128 400 = 2^4 * 5^2 = 20^2
MATHEMATICA
nn = 200; i = k = 1; MapIndexed[Set[S[First[#2]], #1] &, Select[Range[nn], 1 == Min[#] < Max[#] &@ FactorInteger[#][[All, -1]] &] ]; Union@ Reap[While[j = 1; While[S[i]^j < nn, Sow[S[i]^j]; j++]; j > 1, k++; i++] ][[-1, 1]]
PROG
(Python)
from math import isqrt
from sympy import integer_nthroot
from oeis_sequences.OEISsequences import bisection, squarefreepi
def A390055(n):
def g(x):
c, l, j = 1+x-squarefreepi(integer_nthroot(x, 3)[0])-squarefreepi(x), 0, isqrt(x)
while j>1:
k2 = integer_nthroot(x//j**2, 3)[0]+1
w = squarefreepi(k2-1)
c += j*(l-w)
l, j = w, isqrt(x//k2**3)
return c+l
def f(x): return n+x-g(x)-sum(g(integer_nthroot(x, k)[0]) for k in range(2, x.bit_length()))
return bisection(f, n, n) # Chai Wah Wu, Oct 31 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael De Vlieger, Oct 24 2025
STATUS
approved
