|
|
A336390
|
|
Lexicographically earliest infinite sequence such that a(i) = a(j) => A336467(i) = A336467(j) and A336158(i) = A336158(j), for all i, j >= 1.
|
|
10
|
|
|
1, 1, 2, 1, 3, 2, 2, 1, 4, 3, 3, 2, 5, 2, 6, 1, 7, 4, 8, 3, 9, 3, 3, 2, 10, 5, 11, 2, 12, 6, 2, 1, 6, 7, 6, 4, 13, 8, 14, 3, 15, 9, 16, 3, 17, 3, 3, 2, 4, 10, 18, 5, 19, 11, 18, 2, 20, 12, 12, 6, 21, 2, 22, 1, 23, 6, 24, 7, 6, 6, 7, 4, 25, 13, 26, 8, 6, 14, 8, 3, 27, 15, 15, 9, 28, 16, 29, 3, 30, 17, 14, 3, 9, 3, 29, 2, 31, 4, 17, 10, 32, 18, 33, 5, 34
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Restricted growth sequence transform of the ordered pair [A336467(n), A336158(n)].
For all i, j:
|
|
LINKS
|
|
|
PROG
|
(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; };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523
A336467(n) = { my(f=factor(n)); prod(k=1, #f~, if(2==f[k, 1], 1, (A000265(f[k, 1]+1))^f[k, 2])); };
v336390 = rgs_transform(vector(up_to, n, Aux336390(n)));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|