A340381 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(A304759(i)) = A278222(A304759(j)), for all i, j >= 1.

1, 2, 1, 1, 3, 2, 2, 3, 4, 1, 1, 1, 1, 1, 2, 4, 5, 3, 3, 5, 5, 2, 1, 3, 1, 2, 1, 5, 5, 1, 1, 6, 1, 1, 4, 7, 1, 1, 7, 7, 3, 1, 2, 1, 5, 3, 1, 4, 1, 2, 5, 1, 5, 2, 5, 7, 3, 1, 7, 5, 5, 2, 5, 8, 2, 5, 3, 5, 1, 3, 7, 9, 6, 2, 4, 5, 2, 3, 3, 10, 11, 1, 1, 5, 4, 1, 2, 3, 7, 1, 10, 7, 7, 2, 1, 6, 1, 2, 1, 1, 5, 1, 2, 3, 7

Offset

1,2

Comments

For all i, j: A304758(i) = A304758(j) => a(i) = a(j) => A340378(i) = A340378(j).

Links

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

Prog

(PARI)
up_to = 65537;
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A289813(n) = { my (d=digits(n, 3)); from digits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A304759(n) = A289813(A048673(n));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A278222(n) = A046523(A005940(1+n));
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; };
v340381 = rgs_transform(vector(up_to, n, A278222(A304759(n))));
A340381(n) = v340381[n];

Crossrefs

Cf. A278222, A304758, A304759, A340378, A340382, A340383.

Cf. A340376 (positions of 2's).

Cf. also A305301.

Sequence in context: A316776 A029308 A218879 * A029259 A159266 A348217

Adjacent sequences: A340378 A340379 A340380 * A340382 A340383 A340384

Keyword

nonn

Author

Antti Karttunen, Jan 16 2021

Status

approved