A293215 Restricted growth sequence transform of A293214, where A293214(n) = Product_{d|n, d<n} A019565(d).

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

Offset

1,2

Comments

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

Links

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

Prog

(PARI)
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; };
write_to_bfile(start_offset, vec, bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
A019565(n) = {my(j, v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
A293214(n) = { my(m=1); fordiv(n, d, if(d < n, m *= A019565(d))); m; };
write_to_bfile(1, rgs_transform(vector(16384, n, A293214(n))), "b293215.txt");

Crossrefs

Cf. A001065, A019565, A048675, A293214, A293217 (a variant), A293223, A293224, A293226.

Differs from related A293232 for the first time at n=55, where a(55) = 28, while A293232(55) = 39.

Sequence in context: A300231 A351030 A329381 * A293232 A300835 A369051

Adjacent sequences: A293212 A293213 A293214 * A293216 A293217 A293218

Keyword

nonn

Author

Antti Karttunen, Oct 03 2017

Status

approved