OFFSET
1,1
COMMENTS
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
FORMULA
Sum_{n>=1} 1/a(n) = 15/Pi^2 - (P(2)^2 - P(4))/2 - P(2) - 1 = 0.0038030400092245298715..., where P(k) is the prime zeta function. - Amiram Eldar, Dec 10 2025
EXAMPLE
Table of n, a(n) for select n:
n a(n)
-------------------------------------------
1 900 = 30^2 = 2^2 * 3^2 * 5^2
2 1764 = 42^2 = 2^2 * 3^2 * 7^2
3 4356 = 60^2 = 2^2 * 3^2 * 11^2
4 4900 = 70^2 = 2^2 * 5^2 * 7^2
5 6084 = 78^2 = 2^2 * 3^2 * 13^2
6 10404 = 102^2 = 2^2 * 3^2 * 17^2
7 11025 = 105^2 = 3^2 * 5^2 * 7^2
8 12100 = 110^2 = 2^2 * 5^2 * 11^2
9 12996 = 114^2 = 2^2 * 3^2 * 19^2
10 16900 = 130^2 = 2^2 * 5^2 * 13^2
11 19044 = 138^2 = 2^2 * 3^2 * 23^2
20 44100 = 210^2 = 2^2 * 3^2 * 5^2 * 7^2
MATHEMATICA
Select[Range[360], And[SquareFreeQ[#], PrimeNu[#] > 2] &]^2
PROG
(Python)
from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
from oeis_sequences.OEISsequences import bisection
def A391320(n):
def g(x, a, b, c, m): yield from (((d, ) for d in enumerate(primerange(b+1, isqrt(x//c)+1), a+1)) if m==2 else (((a2, b2), )+d for a2, b2 in enumerate(primerange(b+1, integer_nthroot(x//c, m)[0]+1), a+1) for d in g(x, a2, b2, c*b2, m-1)))
def f(x): return int(n+x-sum(sum(primepi(isqrt(x)//prod(c[1] for c in a))-a[-1][0] for a in g(isqrt(x), 0, 1, 1, i)) for i in range(3, x.bit_length()>>1)))
return bisection(f, n, n) # Chai Wah Wu, Dec 10 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Dec 08 2025
STATUS
approved
