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”).

A366802
Lexicographically earliest infinite sequence such that a(i) = a(j) => A366801(i) = A366801(j) for all i, j >= 0, where A366801 is arithmetic derivative without its inherited divisor applied to the Doudna sequence.
6
1, 2, 2, 3, 2, 4, 3, 5, 2, 6, 7, 7, 3, 6, 5, 8, 2, 9, 10, 11, 11, 12, 13, 14, 3, 9, 14, 10, 5, 9, 8, 4, 2, 13, 15, 16, 16, 17, 18, 18, 19, 20, 21, 22, 23, 17, 19, 15, 3, 14, 13, 15, 18, 24, 16, 13, 5, 14, 15, 11, 8, 14, 4, 25, 2, 26, 16, 27, 19, 28, 29, 30, 31, 32, 33, 34, 35, 36, 27, 37, 27, 38, 39, 40, 41, 42, 43, 28
OFFSET
0,2
COMMENTS
Restricted growth sequence transform of A366801.
LINKS
PROG
(PARI)
\\ Needs also program from A366801:
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; };
v366802 = rgs_transform(vector(1+up_to, n, A366801(n-1)));
A366802(n) = v366802[1+n];
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 24 2023
STATUS
approved