A300235 -id:A300235 - cp's OEIS frontend

A300230 Restricted growth sequence transform of A286570, combining A009194(n) and A046523(n), i.e., gcd(n,sigma(n)) and the prime signature of n.

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

Offset: 1

Antti Karttunen, Mar 01 2018

nonn

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

Cf. A009194, A046523, A286570.

Cf. also A300223, A300226, A300229, A300231, A300232, A300233, A300235.

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])); }
A009194(n) = gcd(n, sigma(n));
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from A046523
A286570(n) = (1/2)*(2 + ((A046523(n)+A009194(n))^2) - A046523(n) - 3*A009194(n));
write_to_bfile(1,rgs_transform(vector(65537,n,A286570(n))),"b300230.txt");

A300229 Restricted growth sequence transform of A285729, combining A032742(n) and A046523(n), the largest proper divisor and the prime signature of n.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Mar 01 2018

nonn

			a(10) = a(15) (= 7) because both are nonsquare semiprimes (2*5 and 3*5), and when the smallest prime factor is divided out, both yield the same quotient, 5.

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

Cf. A032742, A046523, A285729.

Cf. also A300223, A300226, A300230, A300231, A300232, A300233, A300235.

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])); }
A032742(n) = if(1==n,n,n/vecmin(factor(n)[,1]));
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A285729(n) = (1/2)*(2 + ((A032742(n)+A046523(n))^2) - A032742(n) - 3*A046523(n));
write_to_bfile(1,rgs_transform(vector(65537,n,A285729(n))),"b300229.txt");

A300249 Filter sequence combining A003415(n) and A046523(n), the arithmetic derivative of n and the prime signature of n.

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

Offset: 1

Antti Karttunen, Mar 04 2018

nonn

Restricted growth sequence transform of P(A003415(n), A046523(n)), where P(a,b) is a two-argument form of A000027 used as a Cantor pairing function N x N -> N.

			a(51) = a(91) (= 33) because both are nonsquare semiprimes (3*17 and 7*13), and also their arithmetic derivatives are equal, as A003415(51) = A003415(91) = 20.
a(78) = a(105) (= 56) because both have the same prime signature (78 = 2*3*13 and 105 = 3*5*7), and also their arithmetic derivatives are equal, as A003415(78) = A003415(105) = 71.

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

Cf. A003415, A046523.
Cf. also A300226, A300229, A300248.
Differs from A300235 for the first time at n=105, where a(105)=56, while A300235(105)=75.

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])); }
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
A046523(n) = my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]) \\ From A046523
Aux300249(n) = ((1/2)*(2 + ((A003415(n)+A046523(n))^2) - A003415(n) - 3*A046523(n)));
write_to_bfile(1,rgs_transform(vector(65537,n,Aux300248(n))),"b300249.txt");

A300231 Filter sequence combining A001065(n) and A009194(n), the sum of proper divisors of n and gcd(n,sigma(n)).

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

Offset: 1

Antti Karttunen, Mar 01 2018

nonn

Restricted growth sequence transform of P(A001065(n), A009194(n)), where P(a,b) is a two-argument form of A000027 used as a Cantor pairing function N x N -> N.

			a(27) = a(35) (= 19) because A001065(27) = A001065(35) = 13 and A009194(27) = A009194(35) = 1.

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

Cf. A001065, A009194.

Cf. also A295885, A300223, A300226, A300229, A300230, A300232, A300233, A300235.

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])); }
A001065(n) = (sigma(n)-n);
A009194(n) = gcd(n, sigma(n));
Aux300231(n) = (1/2)*(2 + ((A001065(n)+A009194(n))^2) - A001065(n) - 3*A009194(n));
write_to_bfile(1,rgs_transform(vector(65537,n,Aux300231(n))),"b300231.txt");

A300232 Restricted growth sequence transform of A286152, filter combining A051953(n) and A046523(n), cototient and the prime signature of n.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Mar 01 2018

nonn

			a(39) = a(55) (= 27) because both are nonsquare semiprimes (3*13 and 5*11), and both have cototient value 15 = 39 - phi(39) = 55 - phi(55).

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

Cf. A046523, A051953, A286152.

Cf. also A295885, A300223, A300224, A300226, A300229, A300230, A300231, A300233, A300235.

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; };
write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[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]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
A286152(n) = (2 + ((A051953(n)+A046523(n))^2) - A051953(n) - 3*A046523(n))/2;
write_to_bfile(1,rgs_transform(vector(up_to,n,A286152(n))),"b300232.txt");

A300233 Filter sequence combining A051953(n) and A009194(n), cototient of n and gcd(n,sigma(n)).

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, 13, 2, 15, 16, 17, 14, 18, 2, 19, 2, 20, 21, 22, 23, 24, 2, 25, 26, 27, 2, 28, 2, 29, 30, 31, 2, 32, 33, 34, 35, 36, 2, 37, 26, 38, 39, 40, 2, 41, 2, 42, 43, 44, 45, 46, 2, 47, 48, 49, 2, 50, 2, 51, 52, 53, 45, 54, 2, 55, 43, 56, 2, 57, 39, 58, 59, 60, 2, 61, 62, 60, 63, 55, 64, 65, 2, 66

Offset: 1

Antti Karttunen, Mar 01 2018

nonn

Restricted growth sequence transform of P(A051953(n), A009194(n)), where P(a,b) is a two-argument form of A000027 used as a Cantor pairing function N x N -> N.

			a(20) = a(22) (= 13) because A051953(20) = A051953(22) = 12 and A009194(20) = A009194(22) = 2.

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

Cf. A009194, A051953.

Cf. also A295885, A300223, A300226, A300229, A300230, A300231, A300232, A300235.

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])); }
A009194(n) = gcd(n, sigma(n));
A051953(n) = (n - eulerphi(n));
Aux300233(n) = (1/2)*(2 + ((A051953(n)+A009194(n))^2) - A051953(n) - 3*A009194(n));
write_to_bfile(1,rgs_transform(vector(65537,n,Aux300233(n))),"b300233.txt");

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.

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, 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];

A305895 Filter sequence combining sum of proper divisors (A001065) and cototient (A051953) of n.

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, Jun 14 2018

nonn

Restricted growth sequence transform of ordered pair [A001065(n), A051953(n)].

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

Cf. A001065, A051953, A295885, A305800.
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.

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; };
A001065(n) = (sigma(n)-n);
A051953(n) = (n-eulerphi(n));
Aux305895(n) = [A001065(n), A051953(n)];
v305895 = rgs_transform(vector(up_to,n,Aux305895(n)));
A305895(n) = v305895[n];

a(1) = 1; for n > 1, a(n) = 1 + A295885(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];

cp's OEIS Frontend

A300230 Restricted growth sequence transform of A286570, combining A009194(n) and A046523(n), i.e., gcd(n,sigma(n)) and the prime signature of n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A300229 Restricted growth sequence transform of A285729, combining A032742(n) and A046523(n), the largest proper divisor and the prime signature of n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

A300249 Filter sequence combining A003415(n) and A046523(n), the arithmetic derivative of n and the prime signature of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A300231 Filter sequence combining A001065(n) and A009194(n), the sum of proper divisors of n and gcd(n,sigma(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A300232 Restricted growth sequence transform of A286152, filter combining A051953(n) and A046523(n), cototient and the prime signature of n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

A300233 Filter sequence combining A051953(n) and A009194(n), cototient of n and gcd(n,sigma(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

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

A305895 Filter sequence combining sum of proper divisors (A001065) and cototient (A051953) of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

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

Views

Author

Keywords