Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Nov 14 2019 13:00:04
%S 1,1,1,6,1,10,1,8,12,14,1,500,1,22,100842,240,1,840,1,1372,966306,26,
%T 1,650,465850,34,16,5324,1,148862,1,10,2227758,38,31919986098,2058000,
%U 1,46,8519142,18,1,24,1,8788,673486,58,1,1078,551741398,668409965300,14856594,19652,1,1760,3510806,155897368,38618058,62,1,320166,1,74,1472328,420
%N a(n) = A003415(A324886(n)).
%H Antti Karttunen, <a href="/A329047/b329047.txt">Table of n, a(n) for n = 1..3000</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F a(n) = A003415(A324886(n)) = A003415(A276086(A108951(n))).
%F a(n) = A327860(A108951(n)).
%o (PARI)
%o A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A034386(n) = prod(i=1, primepi(n), prime(i));
%o A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951
%o A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A324886(n) = A276086(A108951(n));
%o A329047(n) = A003415(A324886(n));
%Y Cf. A003415, A034386, A108951, A276086, A324886, A327860.
%K nonn
%O 1,4
%A _Antti Karttunen_, Nov 08 2019