# Computed 2018-05-13 in GP/PARI CALCULATOR Version 2.9.4 (released) amd64 running mingw (x86-64/GMP-6.1.2 kernel) 64-bit version, compiled: Dec 20 2017, gcc version 4.9.1 (GCC), threading engine: single # with the following PARI-program: # # allocatemem(2^30); # up_to = 65537; # rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; }; # A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649 # A003714(n) = { my(s=0,w); while(n>2, w = A072649(n); s += 2^(w-1); n -= fibonacci(w+1)); (s+n); } # A007814(n) = valuation(n,2); # A000265(n) = (n/2^valuation(n, 2)); # A106151(n) = if(n<=1,n,if(n%2,1+(2*A106151((n-1)/2)),(2^(A007814(n)-1))*A106151(A000265(n)))); # A048679(n) = if(!n,n,A106151(2*A003714(n))); # A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; # A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523 # A278222(n) = A046523(A005940(1+n)); # v304101 = rgs_transform(vector(1+up_to,n,A278222(A048679(n-1)))); # A304101(n) = v304101[1+n]; # A304102(n) = { my(m=1); fordiv(n,d,if(d