A328479 - OEIS

A328479

a(n) = n/A328478(n), where A328478(n) is obtained by repeatedly dividing n by the largest primorial that divides it until a fixed point is reached.

1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 16, 1, 6, 1, 4, 1, 2, 1, 24, 1, 2, 1, 4, 1, 30, 1, 32, 1, 2, 1, 36, 1, 2, 1, 8, 1, 6, 1, 4, 1, 2, 1, 48, 1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 60, 1, 2, 1, 64, 1, 6, 1, 4, 1, 2, 1, 72, 1, 2, 1, 4, 1, 6, 1, 16, 1, 2, 1, 12, 1, 2, 1, 8, 1, 30, 1, 4, 1, 2, 1, 96, 1, 2, 1, 4, 1, 6, 1, 8, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

a(n) is the largest term in A025487 that divides n evenly. - Hal M. Switkay, May 04 2021

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..30030

Index entries for sequences related to primorial numbers

FORMULA

a(n) = n / A328478(n).

MATHEMATICA

A111701[n_] := A111701[n] = Block[{m = n, k = 1}, While[IntegerQ[m/Prime[k]], m = m/Prime[k]; k++]; m];