A305902 Restricted growth sequence transform of A305900(A048673(n)).

1, 2, 3, 4, 5, 6, 7, 8, 4, 4, 4, 4, 9, 4, 10, 4, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 4, 4, 24, 25, 4, 26, 4, 27, 28, 4, 29, 30, 4, 31, 4, 32, 33, 34, 35, 4, 36, 37, 38, 39, 40, 41, 4, 42, 4, 4, 43, 44, 45, 46, 47, 48, 49, 50, 51, 4, 52, 4, 53, 54, 55, 56, 57, 58, 59, 60, 61, 4, 62, 63, 64, 4, 4, 65, 66, 67, 4, 68, 4, 69, 70, 71, 72, 73, 74, 4

Offset: 1

Author

Antti Karttunen, Jun 14 2018

Keywords

• nonn

Comments

For all i, j:

a(i) = a(j) => A278224(i) = A278224(j).

a(i) = a(j) => A286583(i) = A286583(j).

a(i) = a(j) => A292251(i) = A292251(j).

Links

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

Crossrefs

Cf. A048673, A305900.

Cf. also A305901.

Programs

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; };
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;
A305900(n) = if(n<=5,n,if(isprime(n),5,3+n-primepi(n)));
v305902 = rgs_transform(vector(up_to,n,A305900(A048673(n))));
A305902(n) = v305902[n];