A349174 -id:A349174 - cp's OEIS frontend

A336702 Numbers whose abundancy index is a power of 2.

1, 6, 28, 496, 8128, 30240, 32760, 2178540, 23569920, 33550336, 45532800, 142990848, 1379454720, 8589869056, 43861478400, 66433720320, 137438691328, 153003540480, 403031236608, 704575228896, 181742883469056, 6088728021160320, 14942123276641920, 20158185857531904, 275502900594021408, 622286506811515392, 2305843008139952128

Offset: 1

Antti Karttunen, Aug 05 2020

nonn

Apart from missing 2, this sequence gives all numbers k such that the binary expansion of A156552(k) is a prefix of that of A156552(sigma(k)), that is, for k > 1, numbers k for which sigma(k) is a descendant of k in A005940-tree. This follows because of the two transitions x -> A005843(x) (doubling) and x -> A003961(x) (prime shift) used to generate descendants in A005940-tree, using A003961 at any step of the process will ruin the chances of encountering sigma(k) anywhere further down that subtree.
Proof: Any left child in A005940 (i.e., A003961(k) for k) is larger than sigma(k), for any k > 2 [see A286385 for a proof], and A003961(n) > n for all n > 1. Thus, apart from A003961(2) = 3 = sigma(2), A003961^t(k) > sigma(k), where A003961^t means t-fold application of prime shift, here with t >= 1. On the other hand, sigma(2n) > sigma(n) for all n, thus taking first some doubling steps before a run of one or more prime shift steps will not rescue us, as neither will taking further doubling steps after a bout of prime shifts.
The first terms of A325637 not included in this sequence are 154345556085770649600 and 9186050031556349952000, as they have abundancy index 6.
From Antti Karttunen, Nov 29 2021: (Start)
Odd terms of this sequence are given by the intersection of A349169 and A349174.
A064989 applied to the odd terms of this sequence gives the fixed points of A326042, i.e., the positions of zeros in A348736, and a subset of the positions of ones in A348941.
Odd terms of this sequence form a subsequence of A348943, but should occur neither in A348748 nor in A348749.
(End)

			For 30240, sigma(30240) = 120960 = 4*30240, therefore, as sigma(k)/k = 2^2, a power of two, 30240 is present.

Antti Karttunen, Table of n, a(n) for n = 1..769 (computed from the b-file of A007691 prepared by T. D. Noe, using Flammenkamp's data)
Index entries for sequences where odd perfect numbers must occur, if they exist at all
Index entries for sequences related to sigma(n)

Cf. A000203, A003961, A005843, A005940, A156552, A163511, A209229, A286385.
Cf. A000396, A027687 (subsequences).
Subsequence of A007691, and after 1, also subsequence of A325637.
Union with {2} gives the positions of zeros in A347381.
Cf. also A326042, A347391, A347392, A347393, A347394, A348736, A348748, A348749, A348941, A348943, A349169, A349174.

isA336702(n) = { my(r=sigma(n)/n); (1==denominator(r)&&!bitand(r, r-1)); }; \\ (Corrected) - Antti Karttunen, Aug 31 2021

A349169 Numbers k such that k * gcd(sigma(k), A003961(k)) is equal to the odd part of {sigma(k) * gcd(k, A003961(k))}, where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.

Original entry on oeis.org

1, 15, 105, 3003, 3465, 13923, 45045, 264537, 459459, 745875, 1541475, 5221125, 8729721, 10790325, 14171625, 29288025, 34563375, 57034575, 71430975, 99201375, 109643625, 144729585, 205016175, 255835125, 295708875, 356080725, 399242025, 419159475, 449323875, 928602675, 939495375, 1083656925, 1941623775, 1962350685, 2083228875

Offset: 1

Antti Karttunen, Nov 10 2021

Numbers k such that A348990(k) [= k/gcd(k, A003961(k))] is equal to A348992(k), which is the odd part of A349162(k), thus all terms must be odd, as A348990 preserves the parity of its argument.
Equally, numbers k for which gcd(A064987(k), A191002(k)) is equal to A000265(gcd(A064987(k), A341529(k))).
Also odd numbers k for which A348993(k) = A319627(k).
Odd terms of A336702 are given by the intersection of this sequence and A349174.
Conjectures:
  (1) After 1, all terms are multiples of 3. (Why?)
  (2) After 1, all terms are in A104210, in other words, for all n > 1, gcd(a(n), A003961(a(n))) > 1. Note that if we encountered a term k with gcd(k, A003961(k)) = 1, then we would have discovered an odd multiperfect number.
  (3) Apart from 1, 15, 105, 3003, 13923, 264537, all other terms are abundant. [These apparently are also the only terms that are not Zumkeller, A083207. Note added Dec 05 2024]
  (4) After 1, all terms are in A248150. (Cf. also A386430).
  (5) After 1, all terms are in A348748.
  (6) Apart from 1, there are no common terms with A349753.
Note: If any of the last four conjectures could be proved, it would refute the existence of odd perfect numbers at once. Note that it seems that gcd(sigma(k), A003961(k)) < k, for all k except these four: 1, 2, 20, 160.
Questions:
  (1) For any term x here, can 2*x be in A349745? (Partial answer: at least x should be in A191218 and should not be a multiple of 3). Would this then imply that x is an odd perfect number? (Which could explain the points (1) and (4) in above, assuming the nonexistence of opn's).

Cf. A000203, A003961, A007949, A064989, A083207, A104210, A161942, A191002, A191218, A228058, A319627, A322361, A326134, A329963, A342671, A348748, A348990, A348992, A348993, A349162, A349164, A349174.
Cf. also A349745, A349746, A349753.
Subsequence of A349749, and of A386430.

Select[Range[10^6], #1/GCD[#1, #3] == #2/(2^IntegerExponent[#2, 2]*GCD[#2, #3]) & @@ {#, DivisorSigma[1, #], Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]]} &] (* Michael De Vlieger, Nov 11 2021 *)

A000265(n) = (n >> valuation(n, 2));
A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA349169(n) = { my(s=sigma(n),u=A003961(n)); (n*gcd(s,u) == A000265(s)*gcd(n,u)); }; \\ (Program simplified Nov 30 2021)

For all n >= 1, A007949(A000203(a(n))) = A007949(a(n)). [sigma preserves the 3-adic valuation of the terms of this sequence] - Antti Karttunen, Nov 29 2021

Name changed and comment section rewritten by Antti Karttunen, Nov 29 2021

A349164 a(n) = A064989(A003961(n) / gcd(sigma(n), A003961(n))), where A003961 shifts the prime factorization of n one step towards larger primes, while A064989 shifts it back towards smaller primes, and sigma is the sum of divisors function.

Original entry on oeis.org

1, 1, 3, 4, 5, 3, 7, 4, 9, 5, 11, 12, 13, 7, 15, 16, 17, 9, 19, 2, 21, 11, 23, 4, 25, 13, 9, 28, 29, 15, 31, 8, 33, 17, 35, 36, 37, 19, 39, 10, 41, 21, 43, 22, 45, 23, 47, 48, 49, 25, 51, 52, 53, 9, 55, 28, 19, 29, 59, 6, 61, 31, 63, 64, 13, 33, 67, 17, 69, 35, 71, 12, 73, 37, 75, 76, 77, 39, 79, 40, 81, 41, 83, 84

Offset: 1

Antti Karttunen, Nov 09 2021

nonn

Cf. A000203, A003961, A319630, A326042, A336702, A342671, A348993, A349161, A349162, A349169, A349174.

Cf. A349144 and A349168 [positions where a(n) is / is not relatively prime with A349163(n) = n/a(n)].

Array[Times @@ Map[If[#1 <= 2, 1, NextPrime[#1, -1]]^#2 & @@ # &, FactorInteger[#2/GCD[##]]] & @@ {DivisorSigma[1, #], Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]]} &, 84] (* Michael De Vlieger, Nov 11 2021 *)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A064989(n) = { my(f=factor(n)); if((n>1 && f[1,1]==2), f[1,2] = 0); for(i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f); };
A349164(n) = { my(u=A003961(n)); A064989(u/gcd(u,sigma(n))); };

a(n) = A064989(A349161(n)).

a(n) = n / A349163(n).

A349176 Odd numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)) > 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Original entry on oeis.org

135, 285, 435, 455, 855, 885, 1185, 1287, 1305, 1335, 1425, 1435, 1485, 1635, 2235, 2275, 2295, 2655, 2685, 2905, 2985, 3105, 3135, 3185, 3311, 3395, 3435, 3555, 3585, 4005, 4035, 4185, 4425, 4785, 4865, 4905, 4995, 5385, 5685, 5805, 5835, 5845, 5925, 6135, 6237, 6335, 6345, 6585, 6675, 6735, 7125, 7155, 7175, 7185

Offset: 1

Antti Karttunen, Nov 11 2021

nonn

			For n = 135 = 3^3 * 5, sigma(135) = 240 = 2^4 * 3 * 5, A003961(135) = 5^3 * 7 = 875, and gcd(135,875) = gcd(240,875) = 5, which is larger than 1, therefore 135 is included in the sequence.

Intersection of A104210 and A349174, or equally, intersection of A349166 and A349174.
Subsequence of A372567.
Cf. A000203, A003961, A319626, A348994, A349161, A349164, A349169.

Select[Range[1, 7200, 2], And[#1/#2 == #1/#3, #2 > 1] & @@ {#3, GCD[#1, #3], GCD[#2, #3]} & @@ {#, DivisorSigma[1, #], Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]]} &] (* Michael De Vlieger, Nov 11 2021 *)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA349176(n) = if(!(n%2),0,my(u=A003961(n),t=gcd(u,n)); (t>1)&&(gcd(u,sigma(n))==t));

A386421 Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that gcd(k, A003961(k)) is equal to gcd(sigma(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Original entry on oeis.org

1, 3, 9, 21, 63, 135, 855, 1485, 25245, 34155, 43785, 46035, 1665825, 1805475, 22982505, 125011845, 127371195, 657814575

Offset: 1

Antti Karttunen, Jul 21 2025

Questions: Are there only multiples of 5 after the five initial terms? Are there any common terms with A228058?

Subsequence of A349174.
Cf. A000203, A000396, A003961.
Cf. also A171929, A228059, A386419, A386420, A386422 for similar sequences.

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
is_A349174(n) = if(!(n%2), 0, my(u=A003961(n)); gcd(u, sigma(n))==gcd(u, n));
m=-1; n=-1; k=0; while(m!=0, n+=2; if(!((n-1)%(2^25)),print1("("n")")); if(is_A349174(n), if((m<0) || abs((sigma(n)/n)-2)

A387164 Numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)), and that satisfy Euler's condition for odd perfect numbers (A228058).

Original entry on oeis.org

117, 153, 333, 369, 425, 477, 549, 637, 657, 845, 873, 909, 925, 1017, 1053, 1233, 1325, 1377, 1413, 1421, 1445, 1525, 1557, 1629, 1737, 1773, 1805, 1813, 1825, 2009, 2097, 2169, 2225, 2313, 2493, 2525, 2529, 2597, 2637, 2725, 2817, 2825, 2853, 2989, 2997, 3033, 3177, 3321, 3357, 3425, 3509, 3573, 3577, 3609, 3725

Offset: 1

Antti Karttunen, Aug 28 2025

Terms k of A228058 for which A322361(k) = A342671(k), or equally, such that A319626(k) = A349164(k).

Intersection of A228058 and A349174.
Union of A387166 and A387167.
Differs from its subsequence A387167 for the first time at n=201, where a(201) = 14157, while A387167(201) = 14225.
Cf. A000203, A003961, A319626, A322361, A342671, A349164.
Cf. also A371082.

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA228058(n) = if(!(n%2)||(omega(n)<2), 0, my(f=factor(n), y=0); for(i=1, #f~, if(1==(f[i, 2]%4), if((1==y)||(1!=(f[i, 1]%4)), return(0), y=1), if(f[i, 2]%2, return(0)))); (y));
isA349174(n) = if(!(n%2), 0, my(u=A003961(n)); gcd(u, sigma(n))==gcd(u, n));
isA387164(n) = (isA228058(n) && isA349174(n));

A349177 Odd numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)) = 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 29, 31, 33, 37, 39, 41, 43, 47, 49, 51, 53, 55, 59, 61, 63, 67, 69, 71, 73, 79, 81, 83, 85, 89, 91, 93, 95, 97, 101, 103, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 137, 139, 141, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 167, 169, 173

Offset: 1

Antti Karttunen, Nov 11 2021

nonn

Odd numbers k for which k and A003961(k) are relatively prime, and also sigma(k) and A003961(k) are coprime.

Subsequence of A349174 from this first differs by not having term 135 (see A349176).
Intersection of A319630 and A349174, or equally, intersection of A349165 and A349174.
Cf. A000203, A003961, A319626, A348994, A349161, A349164, A349169.

Select[Range[1, 173, 2], GCD[#1, #3] == GCD[#2, #3] == 1 & @@ {#, DivisorSigma[1, #], Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]]} &] (* Michael De Vlieger, Nov 11 2021 *)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA349177(n) = if(!(n%2),0,my(u=A003961(n),t=gcd(u,n)); (1==t)&&(gcd(u,sigma(n))==t));

A349175 Odd numbers k for which gcd(k, A003961(k)) <> gcd(sigma(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Original entry on oeis.org

15, 27, 35, 45, 57, 65, 75, 77, 87, 99, 105, 143, 165, 171, 175, 177, 189, 195, 205, 221, 225, 231, 237, 245, 255, 261, 267, 297, 301, 315, 323, 325, 327, 345, 351, 375, 385, 399, 405, 415, 417, 429, 437, 447, 459, 465, 485, 495, 513, 525, 531, 537, 539, 555, 567, 585, 595, 597, 605, 609, 615, 621, 627, 629, 645

Offset: 1

Antti Karttunen, Nov 10 2021

nonn

Odd numbers for which A348994(n) <> A349161(n).

Equally, odd numbers such that A319626(n) <> A349164(n).

Cf. A000203, A003961, A319626, A348994, A349161, A349164.

Cf. A349169, A349174 (complement among the odd numbers).

Select[Range[1, 645, 2], GCD[#1, #3] != GCD[#2, #3] & @@ {#, DivisorSigma[1, #], Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]]} &] (* Michael De Vlieger, Nov 11 2021 *)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA349175(n) = if(!(n%2),0,my(u=A003961(n)); gcd(u,sigma(n))!=gcd(u,n));

cp's OEIS Frontend

A336702 Numbers whose abundancy index is a power of 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A349169 Numbers k such that k * gcd(sigma(k), A003961(k)) is equal to the odd part of {sigma(k) * gcd(k, A003961(k))}, where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A349164 a(n) = A064989(A003961(n) / gcd(sigma(n), A003961(n))), where A003961 shifts the prime factorization of n one step towards larger primes, while A064989 shifts it back towards smaller primes, and sigma is the sum of divisors function.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A349176 Odd numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)) > 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A386421 Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that gcd(k, A003961(k)) is equal to gcd(sigma(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A387164 Numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)), and that satisfy Euler's condition for odd perfect numbers (A228058).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A349177 Odd numbers k for which gcd(k, A003961(k)) = gcd(sigma(k), A003961(k)) = 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A349175 Odd numbers k for which gcd(k, A003961(k)) <> gcd(sigma(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica