cp's OEIS Frontend

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

%I A328613 #14 Oct 22 2019 21:19:00
%S A328613 2,3,10,5,20,5,42,21,56,7,14,7,84,21,14,7,112,7,126,63,28,7,14,7,168,
%T A328613 21,14,7,28,7,330,165,1760,55,110,55,396,99,22,11,88,11,66,33,44,11,
%U A328613 22,11,528,33,22,11,44,11,594,297,88,11,22,11,660,165,110,55,3520,55,66,33,44,11,22,11,792,99,22,11,44,11,66,33,176,11
%N A328613 Starting with m = 1, p = 2 and x = n, iterate m -> m * p^valuation(x,p), x -> floor(x/p), p -> {the next prime after p}, until x is zero. Then a(n) = product of the values of m and p that were reached at the end of the iteration.
%H A328613 Antti Karttunen, <a href="/A328613/b328613.txt">Table of n, a(n) for n = 0..32768</a>
%H A328613 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328613 a(n) = A000040(1+A235224(n)) * A328612(n).
%F A328613 For all n >= 0, A055396(a(n)) = A328570(n) and A020639(a(n)) = A326810(n).
%F A328613 For all n >= 1, A007814(a(n)) = A007814(n).
%F A328613 For all n >= 1, a(A143293(n-1)) = A000040(1+n).
%o A328613 (PARI) A328613(n) = { my(m=1, p=2); while(n, m *= p^valuation(n,p); n = n\p; p = nextprime(1+p)); (m*p); };
%Y A328613 Cf. A000040, A007814, A020639, A055396, A049345, A143293, A235224, A276086, A326810, A328570, A328612.
%K A328613 nonn
%O A328613 0,1
%A A328613 _Antti Karttunen_, Oct 22 2019