A305297 Restricted growth sequence transform of A292260, formed from 0-digits in ternary representation of A245612(n).

1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 4, 1, 1, 3, 4, 2, 1, 5, 6, 7, 8, 2, 4, 8, 1, 9, 1, 2, 8, 10, 1, 1, 1, 11, 12, 1, 5, 13, 14, 15, 6, 4, 1, 7, 8, 16, 7, 9, 1, 17, 18, 19, 1, 8, 8, 3, 6, 17, 20, 4, 1, 17, 4, 3, 1, 21, 22, 23, 24, 25, 4, 26, 27, 1, 24, 28, 29, 9, 5, 4, 5, 13, 10, 30, 1, 31, 14, 13, 6, 32, 33, 6, 34, 15, 18, 4, 1, 35, 6, 31, 36, 1, 30, 36, 1, 37

Offset: 0

Author

Antti Karttunen, May 31 2018

Keywords

• nonn

Comments

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

Links

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

Crossrefs

Cf. A291770, A292260, A245612, A292261.

Cf. also A305296, A305298.

Cf. also A304750.

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;
A254049(n) = A048673((2*n)-1);
A245612(n) = if(n<2,1+n,if(!(n%2),(3*A245612(n/2))-1,A254049(A245612((n-1)/2))));
A291770(n) = { my(s=0, b=1, d); while(n>2, if(!(n%3), s += b); b <<= 1; n \= 3); (s); };
A292260(n) = A291770(A245612(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; };
v305297 = rgs_transform(vector(65538,n,A292260(n-1)));
A305297(n) = v305297[1+n];