OFFSET
1,1
COMMENTS
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
FORMULA
Sum_{n>=1} 1/a(n) = zeta(2)/zeta(4) + zeta(3)/zeta(6) - P(2) - P(3) - 2 = A082020 + A157289 - A085548 - A085541 - 2 = 0.074372644304814449297..., where P is the prime zeta function. - Amiram Eldar, Mar 07 2026
EXAMPLE
Table of n, a(n) for n = 1..12:
n a(n)
-----------------------------------
1 36 = 6^2 = 2^2 * 3^2
2 100 = 10^2 = 2^2 * 5^2
3 196 = 14^2 = 2^2 * 7^2
4 216 = 6^3 = 2^3 * 3^3
5 225 = 15^2 = 3^2 * 5^2
6 441 = 21^2 = 3^2 * 7^2
7 484 = 22^2 = 2^2 * 11^2
8 676 = 26^2 = 2^2 * 13^2
9 900 = 30^2 = 2^2 * 3^2 * 5^2
10 1000 = 10^3 = 2^3 * 5^3
11 1089 = 33^2 = 3^2 * 11^2
12 1156 = 34^2 = 2^2 * 17^2
MATHEMATICA
nn = 15000; i = 1; MapIndexed[Set[S[First[#2]], #1] &, Select[Range@ Sqrt[nn], And[SquareFreeQ[#], CompositeQ[#]] &]]; Union@ Reap[While[j = 2; While[And[j < 4, S[i]^j < nn], Sow[S[i]^j]; j++]; j > 2, i++] ][[-1, 1]]
PROG
(Python)
from math import isqrt
from sympy import primepi, mobius, integer_nthroot
from oeis_sequences.OEISsequences import bisection
def A390126(n):
def f(x): return n+2+x+primepi(w:=integer_nthroot(x, 3)[0])+primepi(m:=isqrt(x))-sum(mobius(k)*(w//k**2+m//k**2) for k in range(1, isqrt(w)+1))-sum(mobius(k)*(m//k**2) for k in range(isqrt(w)+1, isqrt(m)+1))
return bisection(f, n, n) # Chai Wah Wu, Feb 04 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Jan 29 2026
STATUS
approved
