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

1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 4, 3, 5, 2, 1, 1, 6, 1, 5, 1, 1, 1, 1, 1, 1, 1, 7, 4, 8, 3, 5, 5, 9, 2, 10, 1, 11, 1, 6, 6, 12, 1, 1, 5, 1, 1, 1, 1, 1, 1, 2, 1, 5, 1, 1, 1, 1, 1, 13, 7, 14, 4, 8, 8, 15, 3, 16, 5, 17, 5, 9, 9, 7, 2, 18, 10, 19, 1, 11, 11, 12, 1, 20, 6, 21, 6, 12, 12, 7, 1, 22, 1, 5, 5

Offset

0,6

Comments

Restricted growth sequence transform of A366894.

For all i, j >= 0:

A366881(i) = A366881(j) => A366806(i) = A366806(j) => a(i) = a(j).

Links

Antti Karttunen, Table of n, a(n) for n = 0..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; };
A000265(n) = (n>>valuation(n, 2));
A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
A336699(n) = A000265(1+A000265(sigma(A000265(n))));
A366894(n) = A336699(A163511(n));
v366895 = rgs_transform(vector(1+up_to, n, A366894(n-1)));
A366895(n) = v366895[1+n];

Crossrefs

Cf. A000265, A000593, A163511, A324186, A336699, A351565, A366894.

Cf. also A366806, A366881.

Sequence in context: A051904 A070012 A071178 * A326515 A319864 A072776

Adjacent sequences: A366892 A366893 A366894 * A366896 A366897 A366898

Keyword

nonn

Author

Antti Karttunen, Jan 03 2024

Status

approved