|
%I #7 Mar 31 2019 00:17:25
%S 1,3,18,9,324,15,3240,15,270,810,291600,75,14580000,24300,2250,225,
%T 6561000000,1125,1640250000000,6750,607500,3645000,3690562500000000,
%U 1875,337500,546750000,56250,1822500,41518828125000000000,105,581263593750000000000,21,1020600,918540000,283500,315,40688451562500000000000,688905000000,765450000,5670
%N a(1) = 1, and for n > 1, a(n) = A276086(n) * a(A064989(n)).
%H Antti Karttunen, <a href="/A324889/b324889.txt">Table of n, a(n) for n = 1..210</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(1) = 1, and for n > 1, a(n) = A276086(n) * a(A064989(n)).
%F A001222(a(n)) = A324890(n).
%F For all n >= 0, a(A002110(n)) = A002110(1+n)/2.
%o (PARI)
%o A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324889(n) = if(1==n,n,A276086(n) * A324889(A064989(n)));
%Y Cf. A002110, A064989, A276086, A324890.
%K nonn
%O 1,2
%A _Antti Karttunen_, Mar 30 2019
|
