A304748 Restricted growth sequence transform of A291759(n), formed from 2-digits in ternary representation of A048673(n).

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

Offset: 1

Author

Antti Karttunen, May 29 2018

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537
• Index entries for sequences computed from indices in prime factorization

Crossrefs

Cf. A048673, A289814, A291759.

Cf. also A304746.

Programs

PARI

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;
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814
A291759(n) = A289814(A048673(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; };
v304748 = rgs_transform(vector(65537,n,A291759(n)));
A304748(n) = v304748[n];