This site is supported by donations to The OEIS Foundation.

# Radical of n, product of distinct prime factors of n

From OeisWiki

(Redirected from Squarefree kernel of n)

The **radical** (squarefree kernel, largest squarefree divisor) of an integer is the product of distinct prime factors of that integer. For example, the radical of 12 is 6, since 2 × 3 = 6. If an integer is squarefree, it is equal to its radical (see A007947).

Multiplicative with thus with we have

*n* divided by radical of *n*

Multiplicative with thus with we have

## Sequences

A007947 Largest squarefree number dividing , the squarefree kernel of , radical of :

- {1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, ...}

A003557 divided by radical (largest squarefree divisor) of

- {1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 5, 1, 9, 2, 1, 1, 1, 16, 1, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 1, 8, 7, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, ...}

## See also

- Prime factors of n (without multiplicity) (distinct prime factors of n)
- Number of distinct prime factors of n (little omega(n))
- Sum of distinct prime factors of n (sodpf(n))
- Product of distinct prime factors of n (radical of n) (rad(n)) (squarefree kernel of n)