cp's OEIS Frontend

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

%I A366805 #12 Oct 27 2023 13:11:29
%S A366805 1,2,2,2,2,3,2,4,2,5,6,3,2,4,4,4,2,7,8,5,9,10,5,5,2,4,3,4,4,11,4,3,2,
%T A366805 12,13,7,10,14,7,15,16,17,18,10,7,15,9,5,2,4,3,4,5,5,4,3,4,6,8,11,4,3,
%U A366805 3,3,2,19,10,12,16,20,12,19,21,22,23,14,12,19,10,15,24,25,26,17,27,26,17,24,12,19,14,15
%N A366805 Lexicographically  earliest infinite sequence such that a(i) = a(j) => A366803(i) = A366803(j) for all i, j >= 0.
%C A366805 Restricted growth sequence transform of A366803.
%C A366805 The scatter plot has quite interesting structure.
%H A366805 Antti Karttunen, <a href="/A366805/b366805.txt">Table of n, a(n) for n = 0..65537</a>
%o A366805 (PARI)
%o A366805 \\ Needs also program from A366803:
%o A366805 up_to = 65537;
%o A366805 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 A366805 v366805 = rgs_transform(vector(1+up_to,n,A366803(n-1)));
%o A366805 A366805(n) = v366805[1+n];
%Y A366805 Cf. A003415, A005940, A008836, A347395, A366803.
%Y A366805 Cf. also A366796, A366802.
%K A366805 nonn,look
%O A366805 0,2
%A A366805 _Antti Karttunen_, Oct 26 2023