A328474 Lexicographically earliest infinite sequence such that a(i) = a(j) => A046523(A276156(i)) = A046523(A276156(j)) for all i, j.

1, 2, 2, 3, 2, 4, 5, 6, 2, 7, 3, 8, 2, 3, 3, 9, 2, 10, 3, 11, 3, 3, 3, 12, 2, 10, 7, 6, 3, 13, 3, 14, 2, 15, 10, 16, 3, 6, 3, 17, 2, 3, 6, 9, 2, 10, 18, 19, 2, 6, 10, 6, 10, 20, 10, 21, 2, 22, 6, 23, 2, 3, 3, 24, 3, 18, 16, 16, 10, 6, 9, 17, 3, 3, 6, 6, 3, 10, 16, 25, 2, 3, 6, 16, 6, 22, 10, 9, 2, 26, 3, 27, 6, 3, 3, 28, 2, 6, 3, 22, 3, 10, 6, 14, 2

Offset

1,2

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences related to binary expansion of n

Index entries for sequences related to primorial base

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; };
A276156(n) = { my(p=2, pr=1, s=0); while(n, if(n%2, s += pr); n >>= 1; pr *= p; p = nextprime(1+p)); (s); };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
v328474 = rgs_transform(vector(up_to, n, A046523(A276156(n))));
A328474(n) = v328474[n];

Crossrefs

Cf. A002110, A276156, A328461, A328471, A328473.

Sequence in context: A289626 A097004 A324343 * A369065 A318839 A347664

Adjacent sequences: A328471 A328472 A328473 * A328475 A328476 A328477

Keyword

nonn

Author

Antti Karttunen, Oct 18 2019

Status

approved