cp's OEIS Frontend

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}.

%I A328612 #18 Oct 23 2019 19:54:54
%S A328612 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,
%T A328612 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,
%U A328612 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
%N 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}.
%H A328612 Antti Karttunen, <a href="/A328612/b328612.txt">Table of n, a(n) for n = 0..32768</a>
%H A328612 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328612 A001221(a(n)) = A328620(n) = A079067(A276086(n)) = A001221(A328613(n))-1.
%F A328612 For all n >= 1, A007814(a(n)) = A007814(n).
%o A328612 (PARI) A328612(n) = { my(m=1, p=2); while(n, m *= p^valuation(n,p); n = n\p; p = nextprime(1+p)); (m); };
%Y A328612 Cf. A001221, A007814, A079067, A276086, A328613, A328620.
%K A328612 nonn,look
%O A328612 0,3
%A A328612 _Antti Karttunen_, Oct 22 2019