close
login
A382486
Product of distinct prime divisors of n that are <= sqrt(n).
1
1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 5, 2, 3, 2, 1, 30, 1, 2, 3, 2, 5, 6, 1, 2, 3, 10, 1, 6, 1, 2, 15, 2, 1, 6, 7, 10, 3, 2, 1, 6, 5, 14, 3, 2, 1, 30, 1, 2, 21, 2, 5, 6, 1, 2, 3, 70, 1, 6, 1, 2, 15, 2, 7, 6, 1, 10, 3, 2, 1, 42, 5
OFFSET
1,4
LINKS
FORMULA
a(p) = 1, for prime p.
MAPLE
f:= proc(n) convert(select(t -> t^2 <= n, NumberTheory:-PrimeFactors(n)), `*`) end proc:
map(f, [$1..100]); # Robert Israel, Feb 17 2026
MATHEMATICA
Table[Times @@ Select[Divisors[n], PrimeQ[#] && # <= Sqrt[n] &], {n, 1, 85}]
PROG
(PARI) a(n) = vecprod(select(x->x<=sqrt(n), factor(n)[, 1])); \\ Michel Marcus, Apr 17 2025
(Python)
from math import isqrt
from sympy import primefactors
def A382486(n):
m = isqrt(n)
return prod(p for p in primefactors(n) if p<=m) # Chai Wah Wu, May 20 2026
CROSSREFS
KEYWORD
nonn,look,changed
AUTHOR
Ilya Gutkovskiy, Apr 10 2025
STATUS
approved