|
%I #14 Mar 24 2018 18:53:29
%S 1,2,2,3,2,4,2,4,5,6,2,7,2,8,9,7,2,8,2,10,11,12,2,13,14,15,9,16,2,12,
%T 2,13,17,18,19,16,2,20,21,22,2,23,2,24,25,26,2,27,28,12,29,30,2,31,32,
%U 33,34,35,2,24,2,36,37,27,38,39,2,40,41,15,2,33,2,42,17,43,44,45,2,46,25,47,2,48,49,50,51,52,2,53,54,55,56,57,58,59,2,15,60,24
%N Restricted growth sequence transform of a(1) = -1, a(n) = A297168(n) for n > 1.
%C For all i, j: A300827(i) = A300827(j) => a(i) = a(j). - _Antti Karttunen_, Mar 13 2018
%H Antti Karttunen, <a href="/A297169/b297169.txt">Table of n, a(n) for n = 1..65537</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%o (PARI)
%o allocatemem(2^30);
%o up_to = 8192;
%o rgs_transform(invec) = { my(occurrences = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(occurrences,invec[i]), my(pp = mapget(occurrences, invec[i])); outvec[i] = outvec[pp] , mapput(occurrences,invec[i],i); outvec[i] = u; u++ )); outvec; };
%o write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
%o A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
%o A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
%o A297112(n) = if(1==n,0,2^A297167(n));
%o A297168v1(n) = if(1==n,-1,sumdiv(n,d,(d<n)*A297112(d)));
%o write_to_bfile(1,rgs_transform(vector(up_to,n,A297168v1(n))),"b297169.txt");
%o \\ (More efficient PARI program) - _Antti Karttunen_, Mar 13 2018
%Y Cf. A156552, A297112, A297167, A297168, A300827.
%K nonn
%O 1,2
%A _Antti Karttunen_, Feb 27 2018
|
