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!)
 A322590 Lexicographically earliest such positive sequence a that a(i) = a(j) => A007947(i) = A007947(j) for all i, j. 2
 1, 2, 3, 2, 4, 5, 6, 2, 3, 7, 8, 5, 9, 10, 11, 2, 12, 5, 13, 7, 14, 15, 16, 5, 4, 17, 3, 10, 18, 19, 20, 2, 21, 22, 23, 5, 24, 25, 26, 7, 27, 28, 29, 15, 11, 30, 31, 5, 6, 7, 32, 17, 33, 5, 34, 10, 35, 36, 37, 19, 38, 39, 14, 2, 40, 41, 42, 22, 43, 44, 45, 5, 46, 47, 11, 25, 48, 49, 50, 7, 3, 51, 52, 28, 53, 54, 55, 15, 56, 19, 57, 30, 58, 59, 60, 5, 61, 10, 21, 7, 62, 63, 64, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Restricted growth sequence transform of A007947. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = 1 + A285329(n). 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; }; A007947(n) = factorback(factorint(n)[, 1]); v322590 = rgs_transform(vector(up_to, n, A007947(n))); A322590(n) = v322590[n]; CROSSREFS Cf. A007947, A008479 (ordinal transform). One more than A285329. Sequence in context: A286621 A295876 A336147 * A325381 A336152 A323898 Adjacent sequences:  A322587 A322588 A322589 * A322591 A322592 A322593 KEYWORD nonn AUTHOR Antti Karttunen, Dec 17 2018 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 4 16:34 EDT 2020. Contains 336202 sequences. (Running on oeis4.)