cp's OEIS Frontend

A329038 a(n) = A246277(A276086(n)).

%I A329038 #9 Nov 11 2019 18:42:53
%S A329038 0,1,1,3,2,9,1,5,3,15,6,45,2,25,9,75,18,225,4,125,27,375,54,1125,8,
%T A329038 625,81,1875,162,5625,1,7,5,21,10,63,3,35,15,105,30,315,6,175,45,525,
%U A329038 90,1575,12,875,135,2625,270,7875,24,4375,405,13125,810,39375,2,49,25,147,50,441,9,245,75,735,150,2205,18,1225,225,3675,450,11025,36
%N A329038 a(n) = A246277(A276086(n)).
%H A329038 Antti Karttunen, <a href="/A329038/b329038.txt">Table of n, a(n) for n = 0..2310</a>
%H A329038 Antti Karttunen, <a href="/A329038/a329038.txt">Data supplement: n, a(n) computed for n = 0..32768</a>
%H A329038 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A329038 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A329038 a(n) = A246277(A276086(n)).
%F A329038 For n >= 1, A046523(2*a(n)) = A278226(n).
%o A329038 (PARI)
%o A329038 A246277(n) = if(1==n, 0, my(f = factor(n), k = primepi(f[1,1])-1); for (i=1, #f~, f[i,1] = prime(primepi(f[i,1])-k)); factorback(f)/2);
%o A329038 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A329038 A329038(n) = A246277(A276086(n));
%Y A329038 Cf. A046523, A246277, A276086, A278226, A329048 (rgs-transform).
%Y A329038 Cf. also A329345.
%K A329038 nonn
%O A329038 0,4
%A A329038 _Antti Karttunen_, Nov 08 2019