OFFSET
1,3
COMMENTS
For all i, j >= 1:
From Antti Karttunen, Nov 23 2023: (Start)
Conjectured to be equal to the lexicographically earliest infinite sequence such that b(i) = b(j) => A000593(i) = A000593(j), A336158(i) = A336158(j) and A336467(i) = A336467(j), for all i, j >= 1 (this was the original definition). In any case it holds that a(i) = a(j) => b(i) = b(j) for all i, j >= 1. See comment in A351461.
(End)
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65539
PROG
(PARI)
up_to = 65539;
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; };
A000265(n) = (n>>valuation(n, 2));
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };
A206787(n) = sumdiv(n, d, d*(d % 2)*issquarefree(d));
A336651(n) = { my(f=factor(n)); prod(i=1, #f~, if(2==f[i, 1], 1, f[i, 1]^(f[i, 2]-1))); };
v351040 = rgs_transform(vector(up_to, n, Aux351040(n)));
A351040(n) = v351040[n];
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Antti Karttunen, Jan 31 2022
EXTENSIONS
Original definition moved to the comment section and replaced with a definition that is at least as encompassing, and conjectured to be equal to the original one. - Antti Karttunen, Nov 23 2023
STATUS
approved