A351034 -id:A351034 - cp's OEIS frontend

A351030 Lexicographically earliest infinite sequence such that a(i) = a(j) => A351031(i) = A351031(j) and A351032(i) = A351032(j), for all i, j >= 1.

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, 23, 25, 2, 26, 27, 28, 2, 29, 2, 30, 31, 32, 2, 33, 34, 35, 36, 37, 2, 38, 39, 40, 41, 42, 2, 43, 2, 44, 45, 46, 36, 47, 2, 48, 49, 50, 2, 51, 2, 52, 53, 54, 55, 56, 2, 57, 58, 59, 2, 60, 61, 62

Offset: 1

Antti Karttunen, Jan 29 2022

nonn

Restricted growth sequence transform of the ordered pair [A351031(n), A351032(n)], or equally, of the ordered pair [A351033(n), A351034(n)].

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

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

Cf. A019565, A048673, A289813, A289814, A291759, A304759, A351031, A351032 A351033, A351034.

Cf. also A293226, A349910.

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; };
A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
A048673(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (1+factorback(f))/2; };
A289813(n) = { my(d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); };
A289814(n) = { my(d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); };
A291759(n) = A289814(A048673(n));
A304759(n) = A289813(A048673(n));
A351031(n) = { my(m=1); fordiv(n,d,if(dA019565(A304759(d)))); (m); };
A351032(n) = { my(m=1); fordiv(n,d,if(dA019565(A291759(d)))); (m); };
Aux351030(n) = [A351031(n),A351032(n)];
v351030 = rgs_transform(vector(up_to, n, Aux351030(n)));
A351030(n) = v351030[n];

A351032 a(n) = Product_{d|n, dA019565(A291759(d)).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 4, 1, 2, 1, 24, 1, 6, 1, 8, 1, 12, 1, 8, 3, 6, 1, 480, 1, 2, 1, 72, 1, 120, 1, 16, 3, 2, 3, 480, 1, 2, 1, 32, 1, 216, 1, 120, 5, 6, 1, 13440, 3, 60, 1, 120, 1, 168, 3, 1440, 1, 6, 1, 144000, 1, 10, 3, 32, 1, 1080, 1, 8, 3, 72, 1, 26880, 1, 10, 75, 24, 9, 1080, 1, 128, 7, 10, 1, 86400, 1, 30, 3

Offset: 1

Antti Karttunen, Jan 29 2022

nonn

Index entries for sequences computed from indices in prime factorization

Cf. A019565, A048673, A289814, A291759, A351030, A351031, A351034 (rgs-transform).

Cf. also A293222.

A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
A048673(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (1+factorback(f))/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));
A351032(n) = { my(m=1); fordiv(n,d,if(dA019565(A291759(d)))); (m); };

A351033 Lexicographically earliest infinite sequence such that a(i) = a(j) => A351031(i) = A351031(j), for all i, j >= 1.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Jan 29 2022

Restricted growth sequence transform of A351031.

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

Cf. A019565, A048673, A289813, A304759, A351030, A351031, A351034.

Cf. also A293223.

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; };
A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
A048673(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (1+factorback(f))/2; };
A289813(n) = { my(d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A304759(n) = A289813(A048673(n));
A351031(n) = { my(m=1); fordiv(n,d,if(dA019565(A304759(d)))); (m); };
v351033 = rgs_transform(vector(up_to, n, A351031(n)));
A351033(n) = v351033[n];

cp's OEIS Frontend

A351030 Lexicographically earliest infinite sequence such that a(i) = a(j) => A351031(i) = A351031(j) and A351032(i) = A351032(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A351032 a(n) = Product_{d|n, dA019565(A291759(d)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A351033 Lexicographically earliest infinite sequence such that a(i) = a(j) => A351031(i) = A351031(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI