A336701 -id:A336701 - cp's OEIS frontend

A336698 a(n) = A000265(1+A000265(sigma(n))), where A000265(k) gives the odd part of k.

1, 1, 1, 1, 1, 1, 1, 1, 7, 5, 1, 1, 1, 1, 1, 1, 5, 5, 3, 11, 1, 5, 1, 1, 1, 11, 3, 1, 1, 5, 1, 1, 1, 7, 1, 23, 5, 1, 1, 23, 11, 1, 3, 11, 5, 5, 1, 1, 29, 47, 5, 25, 7, 1, 5, 1, 3, 23, 1, 11, 1, 1, 7, 1, 11, 5, 9, 1, 1, 5, 5, 49, 19, 29, 1, 9, 1, 11, 3, 47, 61, 1, 11, 1, 7, 17, 1, 23, 23, 59, 1, 11, 1, 5, 1, 1, 25

Offset: 1

Antti Karttunen, Aug 02 2020

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Index entries for sequences related to sigma(n)

Cf. A000203, A000265, A161942, A336699, A336701.

A000265(n) = (n>>valuation(n,2));
A336698(n) = A000265(1+A000265(sigma(n)));

a(n) = A000265(1+A000265(A000203(n))) = A000265(1+A161942(n)).

a(A000265(n)) = A336699(n).

A336700 Numbers k such that the odd part of (1+k) divides (1 + odd part of sigma(k)).

Original entry on oeis.org

1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 2431, 2943, 3775, 4095, 8191, 13311, 14335, 16383, 17407, 21951, 22527, 32767, 34335, 44031, 57855, 65535, 85375, 131071, 204799, 262143, 376831, 524287, 923647, 1048575, 1562623, 1632255, 2056191, 2097151, 2744319, 4194303, 6815743, 8388607, 8781823, 10059775, 16777215

Offset: 1

Antti Karttunen, Aug 02 2020

nonn

Numbers k for which A337194(k) = 1+A161942(k) is a multiple of A000265(1+k).

Conjecture: After 1, all terms are of the form 4u+3 (in A004767). If this could be proved, then it would refute at once the existence of both the odd perfect numbers and the quasiperfect numbers. Concentrating on the latter is probably easier, as it is known that all quasiperfect numbers must be odd squares, thus k is of the form 4u+1, in which case the condition given in A336701 that A000265(1+A000265(sigma(k))) must be equal to A000265(1+k) reduces to a simpler form, A000265(1+sigma(k)) = (1+k)/2, and as k = s^2, with s odd, so (s^2 + 1)/2 should divide 1+sigma(s^2). Does that condition allow any other solutions than s=1 ? See A337339.

Antti Karttunen, Table of n, a(n) for n = 1..77; all terms < 2^32
Paolo Cattaneo, Sui numeri quasiperfetti, Bollettino dell’Unione Matematica Italiana, Serie 3, Vol.6(1951), n.1, p. 59-62.
P. Hagis and G. L. Cohen, Some Results Concerning Quasiperfect Numbers, J. Austral. Math. Soc. Ser. A 33, 275-286, 1982.
V. Siva Rama Prasad and C. Sunitha, On quasiperfect numbers, Notes on Number Theory and Discrete Mathematics, Vol. 23, 2017, No. 3, 73-78.
Eric Weisstein's World of Mathematics, Quasiperfect Number
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, A000265, A004767, A016754, A161942, A228058, A336697, A336698, A337339, A337342.

Subsequences: A000225, A336701 (terms where the quotient is a power of 2).

Block[{f}, f[n_] := n/2^IntegerExponent[n, 2]; Select[Range[2^20], Mod[f[1 + f[DivisorSigma[1, #]]], f[1 + #]] == 0 &] ] (* Michael De Vlieger, Aug 22 2020 *)

A000265(n) = (n>>valuation(n,2));
isA336700(n) = !((1+A000265(sigma(n)))%A000265(1+n));

A332223 a(1) = 1, and for n > 1, a(n) = A005940(1+sigma(A156552(n))).

Original entry on oeis.org

1, 2, 4, 5, 8, 9, 16, 7, 25, 18, 32, 25, 64, 21, 21, 49, 128, 27, 256, 35, 40, 121, 512, 49, 125, 385, 49, 121, 1024, 13, 2048, 13, 225, 1573, 105, 77, 4096, 57, 187, 343, 8192, 63, 16384, 65, 55, 4693, 32768, 121, 625, 32, 15625, 85, 65536, 81, 180, 91, 253, 9945, 131072, 175, 262144, 508079, 625, 847, 729, 169, 524288, 2057, 2601, 105, 1048576

Offset: 1

Antti Karttunen, Feb 12 2020

nonn

From Antti Karttunen, Jul 31 - Aug 06 2020: (Start)
As a curiosity, like with sigma, also here a(14) = a(15). [Cf. also A003973 and A341512]
Question: is it possible that a(k) = 2*k for any k? If not, then the deficiency (A033879) cannot be -1, and there are no quasiperfect numbers. If there were such cases, then A156552(k) = q would be an instance of quasiperfect number, which should also be an odd square, thus k would need to be of the form 4u+2.
In range n <= 10000, a(n) is a nontrivial multiple of n only at n = [25, 35, 343, 539, 847, 3315] with a(n) = [125, 105, 2401, 2695, 2541, 9945]. The quotients are thus also odd: 5, 3, 7, 5, 3, 3.
This rather meager empirical evidence motivates a conjecture that no quotient a(n)/n may be an even integer, and particularly, never a power of 2 larger than one, which (when translated back to the ordinary, unconjugated sigma) claims that it is not possible that sigma(n) = 2^k * n + 2^k - 1, for any n > 1, k > 0. See also A336700 and A336701, where this leads to a rather surprising empirical observation.
(End)

Antti Karttunen, Table of n, a(n) for n = 1..10000 (computed using Hans Havermann's factorization of A156552)
P. Hagis and G. L. Cohen, Some Results Concerning Quasiperfect Numbers, J. Austral. Math. Soc. Ser. A 33, 275-286, 1982.
V. Siva Rama Prasad and C. Sunitha, On quasiperfect numbers, Notes on Number Theory and Discrete Mathematics, Vol. 23, 2017, No. 3, 73-78.
Eric Weisstein's World of Mathematics, Quasiperfect Number
Index entries for sequences computed from indices in prime factorization
Index entries for sequences related to sigma(n)

Cf. A000203, A005940, A027687, A156552, A246277, A323243, A324201, A324899, A324909, A332224, A332225, A332463 (Möbius transform).
Cf. A003961, A332449, A332450, A332451, A332460 (for other functions similarly conjugated).
Cf. also A003973, A033879, A326042, A332222, A336700, A336701, A341512.

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552
A332223(n) = if(1==n,n,A005940(1+sigma(A156552(n))));

A332223(n) = if(1==n,n,A005940(1+sumdiv(A156552(n),d,d))); \\ Antti Karttunen, Aug 04 2020

For n > 1, a(n) = A005940(1+A000203(A156552(n))) = A005940(1+A323243(n)).
a(A324201(n)) = A003961(A324201(n)). [It's an open problem whether A324201 gives all such solutions]
For n > 1, a(n) = A005940(1 + (Sum_{d|A156552(n)} d)). - Antti Karttunen, Aug 04 2020

A336699 a(n) = A000265(1+A000265(sigma(A000265(n)))), where A000265(k) gives the odd part of k, and sigma is the sum of divisors function.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 5, 7, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 5, 1, 7, 5, 3, 1, 1, 11, 1, 3, 1, 5, 1, 1, 1, 29, 1, 5, 1, 7, 3, 5, 1, 3, 1, 1, 1, 1, 1, 7, 1, 11, 1, 9, 5, 1, 1, 5, 7, 19, 5, 1, 3, 1, 1, 3, 1, 61, 11, 11, 1, 7, 3, 1, 1, 23, 5, 1, 1, 1, 1, 1, 1, 25, 29, 5, 1, 13, 5, 7, 1, 1

Offset: 1

Antti Karttunen, Aug 02 2020

See the "lacunae" in the scatter plot. - Antti Karttunen, Mar 27 2022

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Jon Maiga, Computer-generated formulas for A336699, Sequence Machine.
Index entries for sequences related to sigma(n)

Cf. A000203, A000265, A000593, A002131, A082903, A161942, A171435, A322250, A336698, A336700, A336701, A336844 [= a(A003961(n))], A351565.

A000265(n) = (n>>valuation(n,2));
A336699(n) = A000265(1+A000265(sigma(A000265(n))));

a(n) = A000265(1+A000265(A000593(n))) = A000265(1+A161942(A000265(n))).
a(n) = A336698(A000265(n)).
From Antti Karttunen, Mar 27 2022: (Start)
a(n) = A351565(A000593(n)).
[The following formulas were discovered by Sequence Machine]:
a(n) = A351565(A002131(n)) = A000265(1+A000265(A002131(n))).
a(n) = A336698(1+A322250(n)).
a(n) = A171435(A000593(n)+A082903(n)).
(End)

A353365 Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).

Original entry on oeis.org

1, 5, 12, 427, 9120, 9180, 9504, 9720, 9960, 10296, 10620, 10740, 10824, 11070, 11310, 11480, 11484, 11556, 11628, 11748, 11934, 11960, 12024, 12036, 12072, 12084, 12376, 12460, 12510, 12570, 12640, 12924, 12980, 13000, 13216, 13340, 13554, 13804, 13806, 13962, 13984, 14022, 14056, 14094, 14178, 14212, 14336, 14380

Offset: 1

Antti Karttunen, Apr 17 2022

nonn

Numbers k such that sigma(sigma(k)) = 2^e * sigma(k), for some e >= 0.
Numbers k such that sigma(k) is in A336702.
Numbers k for which A000265(A051027(k)) = A161942(k).
If there existed any hypothetical 3-perfect number (A005820) of the form x = 4u+2 and not divisible by 3, then x would be also included in this sequence, as then sigma(sigma(x)) = 12*x = 4*sigma(x). Such x would be also a term of A349745 and of A351458, and x/2 would be a rare odd term of A000396, and also in A336702. See also the diagram in A347392.

Index entries for sequences related to sigma(n)

Cf. A000203, A000265, A000396, A005820, A051027, A161942, A336702.
Subsequence of A066961.
Cf. also A336700, A336701, A347383, A347392, A349745, A351458 and also A353363.

A000265(n) = (n>>valuation(n,2));
isA353365(n) = (A000265(sigma(sigma(n)))==A000265(sigma(n)));

A378988 a(n) = 2*n XOR 1+sigma(n), where XOR is bitwise-xor, A003987.

Original entry on oeis.org

0, 0, 3, 0, 13, 1, 7, 0, 28, 7, 27, 5, 21, 5, 7, 0, 49, 12, 51, 3, 11, 9, 55, 13, 18, 31, 31, 1, 37, 117, 31, 0, 115, 115, 119, 20, 109, 113, 119, 11, 121, 53, 123, 13, 21, 21, 111, 29, 88, 58, 47, 11, 93, 21, 39, 9, 35, 47, 75, 209, 69, 29, 23, 0, 215, 21, 195, 247, 235, 29, 199, 84, 217, 231, 235, 21, 251, 53, 207

Offset: 1

Antti Karttunen, Dec 16 2024

For any hypothetical quasiperfect number q (for which sigma(q) = 2*q+1, see A336701), a(q) would be equal to 2*q XOR 2*q+2 = 2*(q XOR q+1) = 2*A038712(1+q) = A100892(1+q).

See also A000079 and A235796 concerning the "almost perfect" or "least deficient" numbers that give positions of 0's here.

Cf. A000079 (conjectured to give positions of all 0's), A000396 (positions of 1's), A000203, A003987, A028982 (positions of even terms), A028983 (of odd terms), A038712, A100892, A318467, A336701, A378998, A379009 [= a(n^2)].

Cf. also A235796, A294898, A294899, A318457.

Array[BitXor[2*#, DivisorSigma[1, #] + 1] &, 100] (* Paolo Xausa, Dec 16 2024 *)

PARI
```
A378988(n) = bitxor(n+n,1+sigma(n));
```

For all n in A028983, a(n) = 2n+1 XOR sigma(n) = 1+A318467(n).

A387423 The length of binary expansion of n minus the length of the maximal common prefix of the binary expansions of n and sigma(n), where sigma is the sum of divisors function.

Original entry on oeis.org

0, 1, 1, 2, 2, 0, 2, 3, 3, 2, 3, 2, 2, 2, 2, 4, 2, 1, 3, 1, 3, 3, 4, 3, 3, 4, 4, 0, 2, 4, 4, 5, 5, 5, 5, 4, 2, 5, 5, 3, 2, 5, 3, 3, 4, 4, 5, 4, 4, 5, 5, 3, 2, 4, 5, 3, 5, 5, 3, 5, 2, 4, 4, 6, 5, 4, 3, 6, 6, 4, 4, 6, 2, 6, 6, 4, 6, 5, 5, 4, 6, 6, 3, 6, 6, 5, 6, 2, 2, 6, 6, 4, 5, 5, 6, 5, 2, 6, 6, 4, 2, 4, 4, 1, 4

Offset: 1

Antti Karttunen, Sep 01 2025

Positions of 0's in this sequence is given by such numbers n that sigma(n) = 2^k * n + r, for some n >= 1, k >= 0, 0 <= r < 2^k. These would include also quasi-perfect numbers and their generalizations, numbers n such that sigma(n) = 2^k * n + 2^k - 1, for some n > 1, k > 0 (see comments in A332223), if such numbers exist. However, it is conjectured that there are no other zeros than those given by A336702.

Cf. A000203, A000523, A332223, A336700, A336701, A336702 (conjectured positions of 0's), A387422.

Cf. also A347381, A387413.

A387423(n) = { my(a=binary(n), b=binary(sigma(n)), i=1); while(i<=#a,if(a[i]!=b[i],return(#a-(i-1))); i++); (0); };

a(n) = (1+A000523(n)) - A387422(n).

A379009 a(n) = 2*n^2 XOR 1+sigma(n^2).

Original entry on oeis.org

0, 0, 28, 0, 18, 20, 88, 0, 216, 18, 116, 180, 490, 24, 86, 0, 886, 472, 940, 226, 404, 108, 1544, 756, 2028, 74, 500, 200, 1530, 3086, 1120, 0, 3648, 366, 3962, 1160, 3890, 292, 686, 994, 2974, 6540, 2324, 7996, 378, 8104, 6544, 3060, 6192, 1748, 7114, 778, 7874, 2860, 1982, 1224, 2616, 3482, 5860, 11502, 5082

Offset: 1

Antti Karttunen, Dec 16 2024

nonn

For any hypothetical quasiperfect number q^2 (for which sigma(q^2) = 2*q^2 + 1, which are known to be odd squares if they exist at all, see references in A336701), a(q) would be equal to 2*q^2 XOR 2*(q^2)+2 = 2*(q^2 XOR q^2+1) = 2*A038712(1+q^2) = 2*3 = 6.

a(n) = 0 if n^2 is a square that is "almost perfect", also known as "least deficient". Only known examples are powers of 2. See A000079, A033879.

Cf. A000079 (conjectured to give positions of all 0's), A000290, A003987, A033879, A065764, A336701, A378988.

Cf. also A378999, A379007.

Map[BitXor[2*#, DivisorSigma[1, #] + 1] &, Range[100]^2] (* Paolo Xausa, Dec 18 2024 *)

A379009(n) = bitxor(2*(n^2),1+sigma(n^2));

a(n) = A378988(A000290(n)).

A379490 Odd squares s such that 2s is equal to bitwise-AND of 2s and sigma(s).

Original entry on oeis.org

399736269009, 1013616036225, 1393148751631700625, 2998748839068013955625, 3547850289210724050225

Offset: 1

Antti Karttunen, Jan 13 2025

If there are any quasiperfect numbers, i.e., numbers x for which sigma(x) = 2*x+1, then they should occur also in this sequence.
Square roots of these terms are: 632247, 1006785, 1180317225, 54760833075, 59563833735.
Question: Are there any solutions to similar equations "Odd squares s such that 2*s is equal to bitwise-AND of 2*s and A001065(s)" and "Odd squares s such that 3*s is equal to bitwise-AND of 3*s and sigma(s)"? Such sequences would contain odd triperfect numbers, if they exist (cf. A005820, A347391, A347884). - Antti Karttunen, Aug 19 2025
a(6) > 4*10^21. - Giovanni Resta, Aug 19 2025

Paolo Cattaneo, Sui numeri quasiperfetti, Bollettino dell’Unione Matematica Italiana, Serie 3, Vol.6(1951), n.1, p. 59-62.
P. Hagis and G. L. Cohen, Some Results Concerning Quasiperfect Numbers, J. Austral. Math. Soc. Ser. A 33, 275-286, 1982.
V. Siva Rama Prasad and C. Sunitha, On quasiperfect numbers, Notes on Number Theory and Discrete Mathematics, Vol. 23, 2017, No. 3, 73-78.

Odd squares in A324647.
Intersection of A016754 and A324647.
Subsequence of A325311, which is a subsequence of A005231.
Cf. A000203, A001065, A004198, A318468.
Cf. also A336700, A336701, A337339, A337342, A348742, A379474, A379503, A379505, A379949 for other conditions that quasiperfect numbers should satisfy.

k=0; forstep(n=1,oo,2, if(!((n-1)%(2^27)),print1("("n")")); if(!isprime(n) && omega(n)>=3, f = factor(n); sq=n^2; sig=prod(i=1,#f~,((f[i,1]^(1+(2*f[i,2])))-1) / (f[i,1]-1)); if(((2*sq)==bitand(2*sq, sig)), k++; print1(sq,", "))));

a(4) and a(5) from Giovanni Resta, Aug 19 2025

cp's OEIS Frontend

A336698 a(n) = A000265(1+A000265(sigma(n))), where A000265(k) gives the odd part of k.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A336700 Numbers k such that the odd part of (1+k) divides (1 + odd part of sigma(k)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A332223 a(1) = 1, and for n > 1, a(n) = A005940(1+sigma(A156552(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A336699 a(n) = A000265(1+A000265(sigma(A000265(n)))), where A000265(k) gives the odd part of k, and sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A353365 Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A378988 a(n) = 2*n XOR 1+sigma(n), where XOR is bitwise-xor, A003987.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A387423 The length of binary expansion of n minus the length of the maximal common prefix of the binary expansions of n and sigma(n), where sigma is the sum of divisors function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A379009 a(n) = 2*n^2 XOR 1+sigma(n^2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A379490 Odd squares s such that 2s is equal to bitwise-AND of 2s and sigma(s).