| Displaying 1-5 of 5 results found.
page
1
Numbers k such that the largest unitary divisor of sigma(k) that is coprime with A003961(k) is also a unitary divisor of k.
+10
10
1, 2, 10, 34, 106, 120, 216, 260, 340, 408, 440, 580, 672, 696, 820, 1060, 1272, 1666, 1780, 1940, 2136, 2340, 2464, 3320, 3576, 3960, 4280, 4536, 5280, 5380, 5860, 6456, 6960, 7520, 8746, 8840, 9120, 9632, 10040, 10776, 12528, 12640, 13464, 14560, 16180, 16660, 17400, 17620, 19040, 19416, 19992, 21320, 22176, 22968
COMMENTS
Numbers k for which A351546(k) is a unitary divisor of k. The condition guarantees that A351555(k) = 0, therefore this is a subsequence of A351554. The condition is also a necessary condition for A349745, therefore it is a subsequence of this sequence. All six known 3-perfect numbers ( A005820) are included in this sequence. All 65 known 5-multiperfects ( A046060) are included in this sequence. Not all multiperfects ( A007691) are present (only 587 of the first 1600 are), but all 23 known terms of A323653 are terms, while none of the (even) terms of A046061 or A336702 are.
EXAMPLE
For n = 672 = 2^5 * 3^1 * 7^1, and the largest unitary divisor of the sigma(672) [= 2^5 * 3^2 * 7^1] coprime with A003961(672) [= 13365 = 3^5 * 5^1 * 11^1] is 2^5 * 7^1 = 224, therefore A351546(672) is a unitary divisor of 672, and 672 is included in this sequence.
PROG
(PARI)
A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A351546(n) = { my(f=factor(sigma(n)), u= A003961(n)); prod(k=1, #f~, f[k, 1]^((0!=(u%f[k, 1]))*f[k, 2])); };
isA351551(n) = { my(u= A351546(n)); (!(n%u) && 1==gcd(u, n/u)); };
Numbers k such that there are no odd prime factors p of k such that p would not divide A003961(k) and the valuation(k, p) would be different from valuation(sigma(k), p), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.
+10
8
1, 2, 3, 6, 7, 10, 14, 15, 20, 21, 22, 24, 27, 28, 30, 31, 33, 34, 40, 42, 46, 54, 57, 60, 62, 66, 69, 70, 84, 87, 91, 93, 94, 102, 105, 106, 110, 114, 120, 127, 130, 138, 140, 141, 142, 154, 160, 168, 170, 174, 177, 182, 186, 189, 190, 195, 198, 210, 214, 216, 217, 220, 224, 230, 231, 237, 238, 254, 260, 264, 270, 273
COMMENTS
Numbers k for which A351555(k) = 0. This is a necessary condition for the terms of A349169 and of A349745, therefore they are subsequences of this sequence. All six known 3-perfect numbers ( A005820) are included in this sequence. All 65 known 5-multiperfects ( A046060) are included in this sequence. Moreover, all multiperfect numbers ( A007691) seem to be in this sequence.
PROG
(PARI)
A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A351555(n) = { my(s=sigma(n), f=factor(s), u= A003961(n)); sum(k=1, #f~, if((f[k, 1]%2) && 0!=(u%f[k, 1]), (valuation(n, f[k, 1])!=f[k, 2]), 0)); };
Numbers k such that both k and sigma(k) are congruent to 2 modulo 4 and the 3-adic valuation of sigma(k) is exactly 1.
+10
6
26, 74, 122, 146, 194, 218, 234, 314, 362, 386, 458, 482, 554, 626, 650, 666, 674, 698, 746, 794, 818, 842, 866, 914, 1082, 1098, 1154, 1202, 1226, 1314, 1322, 1346, 1418, 1466, 1514, 1538, 1658, 1706, 1746, 1754, 1850, 1874, 1962, 1994, 2018, 2042, 2066, 2106, 2138, 2186, 2234, 2258, 2306, 2402, 2426, 2474, 2498
COMMENTS
All the terms of the form 4u+2 in A349745 (if they exist) are found in this sequence. As A351537 is the intersection of A191218 and A329963, and the latter has asymptotic density zero, so has this sequence also. It is conjectured that A351555(a(n)) is nonzero for all n, which would imply that the intersection with A349745 is empty. - Antti Karttunen, Feb 19 2022
PROG
(PARI) isA351538(n) = if(!(2==(n%4)), 0, my(s=sigma(n)); (2 == (s%4)) && (1==valuation(s, 3)));
Even numbers k such that there is an odd prime p that divides sigma(k), but valuation(k, p) differs from valuation(sigma(k), p), and p does not divide A003961(k), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.
+10
6
4, 8, 12, 16, 18, 26, 32, 36, 38, 44, 48, 50, 52, 56, 58, 64, 68, 72, 74, 76, 78, 80, 82, 86, 88, 90, 92, 96, 98, 100, 104, 108, 112, 116, 118, 122, 124, 126, 128, 132, 134, 136, 144, 146, 148, 150, 152, 156, 158, 162, 164, 166, 172, 176, 178, 180, 184, 188, 192, 194, 196, 200, 202, 204, 206, 208, 212, 218, 222, 226
COMMENTS
Even numbers k such that sigma(k) has an odd prime factor prime(i), but prime(i-1) is not a factor of k, and A286561(k, prime(i)) <> A286561(sigma(k), prime(i)). This differs from the definition of A351542 in that prime(i) is not here required to be a factor of k itself. The condition implies also that if there is any such odd prime factor prime(i) of sigma(k), it must be >= 5. Even numbers k for which A351555(k) > 0. Question: Is A351538 subsequence of this sequence?
EXAMPLE
12 = 2^2 * 3 is present as sigma(12) = 28 = 2^2 * 7, whose prime factorization contains an odd prime 7 such that neither it nor the immediately previous prime, which is 5, divide 12 itself.
196 = 2^2 * 7^2 is present as sigma(196) = 399 = 3^1 * 7^1 * 19^1, which thus has a shared prime factor 7 with 196, but occurring with smaller exponent, and with no prime 5 (which is the previous prime before 7) present in the prime factorization of 196.
364 = 2^2 * 7^1 * 13^1 is present as sigma(364) = 784 = 2^4 * 7^2, which thus has a shared prime factor 7 with 364, but occurring with larger exponent, and with no prime 5 (which is the previous prime before 7) present in the prime factorization of 364.
PROG
(PARI)
A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A351555(n) = { my(s=sigma(n), f=factor(s), u= A003961(n)); sum(k=1, #f~, if((f[k, 1]%2) && 0!=(u%f[k, 1]), (valuation(n, f[k, 1])!=f[k, 2]), 0)); };
isA351543(n) = (!(n%2) && A351555(n)>0);
CROSSREFS
Cf. A351553 (complement among even numbers).
Even numbers k such that there are no odd prime factors p of k such that p would not divide A003961(k) and the valuation(k, p) would be different from valuation(sigma(k), p), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.
+10
3
2, 6, 10, 14, 20, 22, 24, 28, 30, 34, 40, 42, 46, 54, 60, 62, 66, 70, 84, 94, 102, 106, 110, 114, 120, 130, 138, 140, 142, 154, 160, 168, 170, 174, 182, 186, 190, 198, 210, 214, 216, 220, 224, 230, 238, 254, 260, 264, 270, 280, 282, 290, 308, 310, 318, 322, 330, 340, 354, 374, 378, 380, 382, 390, 408, 410, 420, 426
COMMENTS
Even numbers k for which A351555(k) = 0.
PROG
(PARI)
A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; A351555(n) = { my(s=sigma(n), f=factor(s), u= A003961(n)); sum(k=1, #f~, if((f[k, 1]%2) && 0!=(u%f[k, 1]), (valuation(n, f[k, 1])!=f[k, 2]), 0)); };
isA351553(n) = (!(n%2) && 0== A351555(n));
CROSSREFS
Cf. A351543 (complement among even numbers).
Search completed in 0.005 seconds
| 