A368693 Lexicographically earliest infinite sequence such that a(i) = a(j) => A368698(i) = A368698(j) for all i, j >= 0.

1, 1, 2, 3, 4, 2, 5, 6, 7, 4, 8, 3, 9, 5, 10, 11, 12, 7, 7, 4, 13, 8, 14, 5, 15, 9, 9, 5, 16, 10, 17, 18, 19, 12, 20, 6, 12, 7, 21, 11, 22, 13, 13, 11, 23, 14, 24, 11, 25, 15, 15, 9, 23, 9, 26, 5, 27, 16, 28, 21, 29, 17, 30, 31, 32, 19, 19, 20, 33, 20, 34, 6, 35, 12, 34, 36, 26, 21, 21, 11, 37, 22, 22, 36, 38, 13, 39

Offset: 0

Author

Antti Karttunen, Jan 12 2024

Keywords

• nonn

Comments

Restricted growth sequence transform of A368698.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384

Crossrefs

Cf. A005940, A344005, A368698.

Programs

PARI

\\ Needs also code or data from A368698.
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; };
v368693 = rgs_transform(vector(1+up_to,n,A368698(n-1)));
A368693(n) = v368693[1+n];