A305895 -id:A305895 - cp's OEIS frontend

A351260 Lexicographically earliest infinite sequence such that a(i) = a(j) => A003415(i) = A003415(j), A003557(i) = A003557(j) and A046523(i) = A046523(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, 25, 26, 2, 27, 28, 29, 2, 30, 2, 31, 32, 33, 2, 34, 35, 36, 37, 38, 2, 39, 28, 40, 41, 42, 2, 43, 2, 44, 45, 46, 47, 48, 2, 49, 50, 51, 2, 52, 2, 53, 54, 55, 47, 56, 2, 57, 58, 59, 2, 60, 41, 61, 62, 63, 2, 64, 37, 65, 66, 67, 68, 69, 2, 70, 71, 72, 2, 73, 2, 74, 56

Offset: 1

Antti Karttunen, Feb 06 2022

Restricted growth sequence transform of the triplet [A003415(n), A003557(n), A046523(n)].
For all i, j >= 1:
  A305800(i) = A305800(j) => a(i) = a(j),
  a(i) = a(j) => A294877(i) = A294877(j),
  a(i) = a(j) => A300249(i) = A300249(j),
  a(i) = a(j) => A344025(i) = A344025(j).

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

Cf. A003415, A003557, A046523.
Cf. also A305800, A294877, A300249, A344025.
Differs from A300235, A305895 and A327931 for the first time at n=105, where a(105) = 56, while A300235(105) = A305895(105) = A327931(105) = 75.
Differs from A300249 for the first time at n=425, where a(425) = 299, while A300249(425) = 198.

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; };
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A003557(n) = (n/factorback(factorint(n)[, 1]));
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
Aux351260(n) = [A003415(n), A003557(n), A046523(n)];
v351260 = rgs_transform(vector(up_to,n,Aux351260(n)));
A351260(n) = v351260[n];

A327931 Lexicographically earliest infinite sequence such that for all i, j, a(i) = a(j) => A327930(i) = A327930(j).

Original entry on oeis.org

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, 35, 36, 37, 38, 2, 39, 28, 40, 41, 42, 2, 43, 2, 44, 45, 46, 47, 48, 2, 49, 50, 51, 2, 52, 2, 53, 54, 55, 47, 56, 2, 57, 58, 59, 2, 60, 41, 61, 62, 63, 2, 64, 37, 65, 66, 67, 68, 69, 2, 70, 71, 72, 2, 73, 2, 74, 75

Offset: 1

Antti Karttunen, Sep 30 2019

nonn

Restricted growth sequence transform of A327930, or equally, of the ordered pair [A003415(n), A319356(n)].
It seems that the sequence takes duplicated values only on primes (A000040) and some subset of squarefree semiprimes (A006881). If this holds, then also the last implication given below is valid.
For all i, j:
  a(i) = a(j) => A000005(i) = A000005(j),
  a(i) = a(j) => A319684(i) = A319684(j),
  a(i) = a(j) => A319685(i) = A319685(j),
  a(i) = a(j) => A101296(i) = A101296(j). [Conjectural, see notes above and in A319357]

			Divisors of 39 are [1, 3, 13, 39], while the divisors of 55 are [1, 5, 11, 55]. Taking their arithmetic derivatives (A003415) yields in both cases [0, 1, 1, 16], thus a(39) = a(55) (= 28, as allotted by restricted growth sequence transform).

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

Cf. A000005, A000040 (positions of 2's), A003415, A006881, A101296, A319356, A319357, A319684, A319685, A327930.
Differs from A300249 for the first time at n=105, where a(105)=75, while A300249(105)=56.
Differs from A300235 for the first time at n=153, where a(153)=110, while A300235(153)=106.
Differs from A305895 for the first time at n=3283, where a(3283)=2502, while A305895(3283)=1845.

up_to = 8192;
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; };
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
v003415 = vector(up_to,n,A003415(n));
A327930(n) = { my(m=1); fordiv(n,d,if((d>1), m *= prime(v003415[d]))); (m); };
v327931 = rgs_transform(vector(up_to, n, A327930(n)));
A327931(n) = v327931[n];

a(p) = 2 for all primes p.

A353560 Lexicographically earliest infinite sequence such that a(i) = a(j) => A046523(i) = A046523(j), A001065(i) = A001065(j) and A051953(i) = A051953(j), for all i, j >= 1.

Original entry on oeis.org

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, 35, 36, 37, 38, 2, 39, 28, 40, 41, 42, 2, 43, 2, 44, 45, 46, 47, 48, 2, 49, 50, 51, 2, 52, 2, 53, 54, 55, 47, 56, 2, 57, 58, 59, 2, 60, 41, 61, 62, 63, 2, 64, 37

Offset: 1

Antti Karttunen, Apr 29 2022

nonn

Restricted growth sequence transform of the triplet [A046523(n), A001065(n), A051953(n)].
For all i,j:
  A305800(i) = A305800(j) => a(i) = a(j),
  a(i) = a(j) => A300232(i) = A300232(j), [Combining A046523 and A051953]
  a(i) = a(j) => A300235(i) = A300235(j), [Combining A046523 and A001065]
  a(i) = a(j) => A305895(i) = A305895(j), [Combining A001065 and A051953]
  a(i) = a(j) => A353276(i) = A353276(j). [Needs all three components]

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

Cf. A001065, A046523, A051953.
Cf. also A101296, A305800, A300232, A353276.
Differs from A300235 for the first time at n=153, where a(153) = 110, while A300235(153) = 106.
Differs from A305895 for the first time at n=3283, where a(3283) = 2502, while A305895(3283) = 1845.
Differs from A327931 for the first time at n=4433, where a(4433) = 2950, while A327931(4433) = 3393.
Differs from A300249 and from A351260 for the first time at n=105, where a(105) = 75, while A300249(105) = A351260(105) = 56.

up_to = 100000;
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; };
A001065(n) = (sigma(n)-n);
A051953(n) = (n-eulerphi(n));
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
Aux353560(n) = [A046523(n), A001065(n), A051953(n)];
v353560 = rgs_transform(vector(up_to,n,Aux353560(n)));
A353560(n) = v353560[n];

A373379 Lexicographically earliest infinite sequence such that a(i) = a(j) => A003415(i) = A003415(j), A085731(i) = A085731(j) and A107463(i) = A107463(j), for all i, j >= 1.

Original entry on oeis.org

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, 35, 36, 37, 38, 2, 39, 28, 40, 41, 42, 2, 43, 2, 44, 45, 46, 47, 48, 2, 49, 50, 51, 2, 52, 2, 53, 54, 55, 47, 56, 2, 57, 58, 59, 2, 60, 41, 61, 62, 63, 2, 64, 37, 65, 66, 67, 68, 69, 2, 70, 71, 72

Offset: 1

Antti Karttunen, Jun 03 2024

nonn

Restricted growth sequence transform of the triple [A003415(n), A085731(n), A107463(n)].
For all i, j >= 1:
  A305800(i) = A305800(j) => a(i) = a(j),
  a(i) = a(j) => A369051(i) = A369051(j),
  a(i) = a(j) => A373363(i) = A373363(j),
  a(i) = a(j) => A373364(i) = A373364(j).
Starts to differ from A300235 at n=153. - R. J. Mathar, Jun 06 2024

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

Cf. A001414, A003415, A085731, A107463, A305800, A369051, A373363, A373364.
Differs from A305895, A327931, and A353560 for the first time at n=1610, where a(1610) = 1112, while A305895(1610) = A327931(1610) = A353560(1610) = 1210.
Cf. also A373150, A373152, A373380.

up_to = 100000;
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; };
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A085731(n) = gcd(A003415(n),n);
A001414(n) = ((n=factor(n))[, 1]~*n[, 2]);
A107463(n) = if(n<=1,n,if(isprime(n),1,A001414(n)));
Aux373379(n) = [A003415(n), A085731(n), A107463(n)];
v373379 = rgs_transform(vector(up_to, n, Aux373379(n)));
A373379(n) = v373379[n];

A361021 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j), A001065(i) = A001065(j) and A051953(i) = A051953(j), for all i, j >= 1.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Mar 03 2023

nonn

Restricted growth sequence transform of the triplet [A007814(n), A001065(n), A051953(n)].
For all i, j >= 1:
  A305801(i) = A305801(j) => a(i) = a(j),
  a(i) = a(j) => A305895(i) = A305895(j),
  a(i) = a(j) => A319346(i) = A319346(j).

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

Cf. A001065, A007814, A051953.
Cf. A305801, A305895, A319346.
Cf. also A353560.
Differs from A353520 for the first time at n=254, where a(254) = 187, while A353520(254) = 125.

up_to = 100000;
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; };
A007814(n) = valuation(n,2);
A001065(n) = (sigma(n)-n);
A051953(n) = (n-eulerphi(n));
Aux361021(n) = [A007814(n), A001065(n), A051953(n)];
v361021 = rgs_transform(vector(up_to,n,Aux361021(n)));
A361021(n) = v361021[n];

cp's OEIS Frontend

A351260 Lexicographically earliest infinite sequence such that a(i) = a(j) => A003415(i) = A003415(j), A003557(i) = A003557(j) and A046523(i) = A046523(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A327931 Lexicographically earliest infinite sequence such that for all i, j, a(i) = a(j) => A327930(i) = A327930(j).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A353560 Lexicographically earliest infinite sequence such that a(i) = a(j) => A046523(i) = A046523(j), A001065(i) = A001065(j) and A051953(i) = A051953(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A373379 Lexicographically earliest infinite sequence such that a(i) = a(j) => A003415(i) = A003415(j), A085731(i) = A085731(j) and A107463(i) = A107463(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A361021 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j), A001065(i) = A001065(j) and A051953(i) = A051953(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI