The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325381 Lexicographically earliest sequence such that a(i) = a(j) => A048250(i) = A048250(j) and A126795(i) = A126795(j) for all i, j. 3
 1, 2, 3, 2, 4, 5, 6, 2, 3, 7, 8, 9, 10, 11, 12, 2, 13, 5, 14, 7, 15, 16, 17, 9, 4, 18, 3, 19, 20, 21, 15, 2, 22, 23, 24, 9, 25, 26, 27, 7, 28, 29, 30, 31, 12, 32, 24, 9, 6, 7, 33, 18, 34, 5, 35, 36, 37, 38, 39, 40, 41, 42, 15, 2, 43, 44, 45, 23, 46, 47, 35, 9, 48, 49, 12, 50, 51, 52, 37, 7, 3, 53, 43, 54, 55, 56, 57, 31, 58, 59, 60, 61, 62, 47, 63, 9, 64, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Restricted growth sequence transform of the ordered pair [A048250(n), A126795(n)]. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 PROG (PARI) 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; }; A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1])); A126795(n) = gcd(n, A048250(n)); v325381 = rgs_transform(vector(up_to, n, [A048250(n), A126795(n)])); A325381(n) = v325381[n]; CROSSREFS Cf. A048250, A126795, A291751, A325382, A325383. Sequence in context: A295876 A336147 A322590 * A336152 A323898 A336154 Adjacent sequences:  A325378 A325379 A325380 * A325382 A325383 A325384 KEYWORD nonn,look AUTHOR Antti Karttunen, May 08 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 09:58 EDT 2020. Contains 336423 sequences. (Running on oeis4.)