A328612 - OEIS

A328612

Starting with m = 1, p = 2 and x = n, iterate m -> m * p^valuation(x,p), x -> floor(x/p), p -> {next prime after p}, until x is zero. Then a(n) = {the value of m at the end of iteration}.

1, 1, 2, 1, 4, 1, 6, 3, 8, 1, 2, 1, 12, 3, 2, 1, 16, 1, 18, 9, 4, 1, 2, 1, 24, 3, 2, 1, 4, 1, 30, 15, 160, 5, 10, 5, 36, 9, 2, 1, 8, 1, 6, 3, 4, 1, 2, 1, 48, 3, 2, 1, 4, 1, 54, 27, 8, 1, 2, 1, 60, 15, 10, 5, 320, 5, 6, 3, 4, 1, 2, 1, 72, 9, 2, 1, 4, 1, 6, 3, 16, 1, 2, 1, 12, 3, 2, 1, 8, 1, 90, 45, 20, 5, 10, 5, 96, 3, 2, 1, 4, 1, 6, 3, 8, 1

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

OFFSET

0,3

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..32768

Index entries for sequences related to primorial base

FORMULA

A001221(a(n)) = A328620(n) = A079067(A276086(n)) = A001221(A328613(n))-1.

For all n >= 1, A007814(a(n)) = A007814(n).

PROG

(PARI) A328612(n) = { my(m=1, p=2); while(n, m *= p^valuation(n, p); n = n\p; p = nextprime(1+p)); (m); };

CROSSREFS