A328399 Lexicographically earliest infinite sequence such that a(i) = a(j) => A328475(i) = A328475(j) for all i, j.

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

Offset

0,3

Comments

Restricted growth sequence transform of A328475, defined as A328475(n) = A111701(A276086(n)).

Links

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

Index entries for sequences related to primorial base

Prog

(PARI)
up_to = 32768;
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; };
A111701(n) = forprime(p=2, , if(n%p, return(n), n /= p));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328475(n) = A111701(A276086(n));
v328399 = rgs_transform(vector(up_to+1, n, A328475(n-1)));
A328399(n) = v328399[1+n];

Crossrefs

Cf. A002110, A053589, A111701, A276086, A143293 (indices of 1's after a(0)=1).

Cf. also A328477.

Sequence in context: A368671 A183912 A144693 * A328171 A029139 A100927

Adjacent sequences: A328396 A328397 A328398 * A328400 A328401 A328402

Keyword

nonn

Author

Antti Karttunen, Oct 19 2019

Status

approved