login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Lexicographically earliest infinite sequence such that a(i) = a(j) => A083345(i) = A083345(j) and A343223(i) = A343223(j), for all i, j >= 1.
2

%I #6 Aug 06 2024 16:38:28

%S 1,2,2,2,2,3,2,4,5,6,2,7,2,8,9,10,2,6,2,11,12,13,2,14,5,15,2,16,2,17,

%T 2,18,19,20,21,22,2,23,24,25,2,26,2,27,28,29,2,30,10,31,32,19,2,33,24,

%U 34,35,17,2,34,2,36,25,37,38,39,2,38,40,41,2,13,2,42,43,44,45,46,2,43,47,48,2,49,35,50,51,52,2,53,54,55,56,57,58,59,2,43,60,61

%N Lexicographically earliest infinite sequence such that a(i) = a(j) => A083345(i) = A083345(j) and A343223(i) = A343223(j), for all i, j >= 1.

%C Restricted growth sequence transform of the ordered pair [A083345(n), A343223(n)].

%H Antti Karttunen, <a href="/A374480/b374480.txt">Table of n, a(n) for n = 1..65537</a>

%o (PARI)

%o up_to = 65537;

%o 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; };

%o A083345(n) = { my(f=factor(n)); numerator(vecsum(vector(#f~, i, f[i, 2]/f[i, 1]))); };

%o A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));

%o A342926(n) = (A003415(sigma(n))-n);

%o A343223(n) = gcd(A003415(n), A342926(n));

%o Aux374480(n) = [A083345(n), A343223(n)];

%o v374480 = rgs_transform(vector(up_to, n, Aux374480(n)));

%o A374480(n) = v374480[n];

%Y Cf. A003415, A083345, A342926, A343223.

%Y Cf. also A305800, A373151, A374131.

%K nonn

%O 1,2

%A _Antti Karttunen_, Aug 06 2024