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

1, 2, 2, 1, 2, 3, 4, 3, 2, 5, 6, 7, 8, 1, 4, 9, 2, 10, 11, 12, 13, 9, 14, 15, 16, 3, 17, 18, 8, 3, 4, 5, 2, 19, 20, 21, 22, 23, 24, 25, 26, 7, 27, 28, 29, 30, 17, 31, 32, 5, 33, 34, 35, 36, 37, 38, 16, 5, 11, 23, 8, 39, 4, 40, 2, 41, 42, 43, 44, 45, 46, 47, 48, 12, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61

Offset

0,2

Comments

Restricted growth sequence transform of A324182.

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; };
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));
A083254(n) = (2*eulerphi(n)-n);
A324182(n) = A083254(A163511(n));
v366804 = rgs_transform(vector(1+up_to, n, A324182(n-1)));
A366804(n) = v366804[1+n];

Crossrefs

Cf. A083254, A163511, A324182.

Sequence in context: A230507 A352888 A354267 * A259910 A072549 A239481

Adjacent sequences: A366801 A366802 A366803 * A366805 A366806 A366807

Keyword

nonn,look

Author

Antti Karttunen, Oct 24 2023

Status

approved