OFFSET
1,1
COMMENTS
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = A052486(n)^2.
From Amiram Eldar, Nov 07 2025: (Start)
Sum_{n>=1} 1/a(n) = zeta(4)*zeta(6)/zeta(12) - 1 - Sum_{k>=2} mu(k)*(1-zeta(2*k)) = 0.00034780766944431258... . (End)
EXAMPLE
Table of n, a(n) for select n:
n a(n)
---------------------------------------
1 5184 = 72^2 = 2^6 * 3^4
2 11664 = 108^2 = 2^4 * 3^6
3 40000 = 200^2 = 2^6 * 5^4
4 82944 = 288^2 = 2^10 * 3^4
5 153664 = 392^2 = 2^6 * 7^4
6 186624 = 432^2 = 2^8 * 3^6
7 250000 = 500^2 = 2^4 * 5^6
8 419904 = 648^2 = 2^6 * 3^8
9 455625 = 675^2 = 3^6 * 5^4
10 640000 = 800^2 = 2^10 * 5^4
11 746496 = 864^2 = 2^10 * 3^6
20 3240000 = 1800^2 = 2^6 * 3^4 * 5^4
MATHEMATICA
nn = 2^12; Rest[Select[Union@ Flatten@ Table[a^2*b^3, {b, Surd[nn, 3]}, {a, Sqrt[nn/b^3]}], GCD @@ FactorInteger[#][[;; , -1]] == 1 &]]^2
PROG
(Python)
from math import isqrt
from sympy import integer_nthroot, mobius
from oeis_sequences.OEISsequences import bisection, squarefreepi
def A390435(n):
def f(x):
y = isqrt(x)
c, l = n+x+1, 0
j = isqrt(y)
while j>1:
k2 = integer_nthroot(y//j**2, 3)[0]+1
w = squarefreepi(k2-1)
c -= j*(w-l)
l, j = w, isqrt(y//k2**3)
c -= squarefreepi(integer_nthroot(y, 3)[0])-l+sum(mobius(k)*(integer_nthroot(y, k)[0]-1) for k in range(2, y.bit_length()))
return c
return bisection(f, n, n) # Chai Wah Wu, Nov 06 2025
(PARI) isok(k) = k > 1 && issquare(k) && ispowerful(sqrtint(k)) && !ispower(sqrtint(k)); \\ Amiram Eldar, Nov 07 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Nov 05 2025
STATUS
approved
