cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-9 of 9 results.

A014663 Primes p such that multiplicative order of 2 modulo p is odd.

Original entry on oeis.org

7, 23, 31, 47, 71, 73, 79, 89, 103, 127, 151, 167, 191, 199, 223, 233, 239, 263, 271, 311, 337, 359, 367, 383, 431, 439, 463, 479, 487, 503, 599, 601, 607, 631, 647, 719, 727, 743, 751, 823, 839, 863, 881, 887, 911, 919, 937, 967, 983, 991, 1031, 1039, 1063
Offset: 1

Views

Author

N. J. A. Sloane, Dec 11 1999

Keywords

Comments

Or, primes p which do not divide 2^n+1 for any n.
The possibility n=0 in the above rules out A072936(1)=2; apart from this, a(n)=A072936(n+1). - M. F. Hasler, Dec 08 2007
The order of 2 mod p is odd iff 2^k=1 mod p, where p-1=2^s*k, k odd. - M. F. Hasler, Dec 08 2007
Has density 7/24 (Hasse).
From Jianing Song, Jun 27 2025: (Start)
The multiplicative order of 2 modulo a(n) is A139686(n).
Contained in primes congruent to 1 or 7 modulo 8 (primes p such that 2 is a quadratic residue modulo p, A001132), and contains primes congruent to 7 modulo 8 (A007522). (End)

References

  • Christopher Adler and Jean-Paul Allouche (2022), Finite self-similar sequences, permutation cycles, and music composition, Journal of Mathematics and the Arts, 16:3, 244-261, DOI: 10.1080/17513472.2022.2116745.
  • P. Moree, Appendix to V. Pless et al., Cyclic Self-Dual Z_4 Codes, Finite Fields Applic., vol. 3 pp. 48-69, 1997.

Crossrefs

Cf. Complement in primes of A091317.
Cf. A001132, A007522, A040098, A045315, A049564, A139686 (the actual multiplicative orders).
Cf. Essentially the same as A072936 (except for missing leading term 2).
Cf. other bases: this sequence (base 2), A385220 (base 3), A385221 (base 4), A385192 (base 5), A163183 (base -2), A385223 (base -3), A385224 (base -4), A385225 (base -5).

Programs

  • Mathematica
    okQ[p_] := OddQ[MultiplicativeOrder[2, p]];
    Select[Prime[Range[1000]], okQ] (* Jean-François Alcover, Nov 23 2024 *)
  • PARI
    isA014663(p)=1==Mod(1,p)<<((p-1)>>factor(p-1,2)[1,2])
    listA014663(N=1000)=forprime(p=3,N,isA014663(p)&print1(p", ")) \\ M. F. Hasler, Dec 08 2007
    
  • PARI
    lista(nn) = {forprime(p=3, nn, if (znorder(Mod(2, p)) % 2, print1(p, ", ")););} \\ Michel Marcus, Feb 06 2015

Extensions

Edited by M. F. Hasler, Dec 08 2007
More terms from Max Alekseyev, Feb 06 2010

A385193 Odd multiplicative orders of 5 modulo primes.

Original entry on oeis.org

1, 5, 9, 3, 29, 5, 39, 25, 27, 65, 69, 37, 75, 89, 15, 19, 33, 35, 119, 25, 67, 27, 155, 165, 179, 21, 97, 25, 17, 209, 215, 219, 115, 239, 245, 249, 135, 71, 285, 299, 309, 35, 329, 115, 359, 123, 375, 405, 9, 419, 429, 455, 459, 235, 485, 495, 509, 255, 515, 173, 525, 265, 267, 109, 575, 45
Offset: 1

Views

Author

Jianing Song, Jun 20 2025

Keywords

Comments

a(n) is the multiplicative order of 5 modulo A385192(n).
Odd elements in A211241.

Examples

			a(8) = 25 since it is the multiplicative order of 5 modulo A385192(8) = 101, and it is odd.
		

Crossrefs

Cf. A211241, A385192 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), A385227 (base 4), this sequence (base 5), A385228 (base -2), A385229 (base -3), A385230 (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[5, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 28 2025 *)
  • PARI
    forprime(p=2, 1e4, if(p!=5, z=znorder(Mod(5, p)); if(z%2, print1(z, ", "))))

A385226 Odd multiplicative orders of 3 modulo primes.

Original entry on oeis.org

1, 5, 3, 11, 23, 29, 35, 41, 53, 27, 65, 83, 89, 45, 95, 113, 57, 119, 125, 131, 69, 155, 39, 173, 179, 191, 209, 105, 43, 27, 221, 233, 239, 49, 251, 135, 281, 293, 299, 75, 323, 329, 31, 177, 359, 183, 371, 9, 413, 207, 419, 431, 443, 455, 473, 485, 491
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

a(n) is the multiplicative order of 3 modulo A385220(n).
Odd elements in A062117.

Crossrefs

Cf. A062117, A385220 (corresponding primes).
Cf. other bases: A139686 (base 2), this sequence (base 3), A385227 (base 4), A385193 (base 5), A385228 (base -2), A385229 (base -3), A385230 (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[3, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 28 2025 *)
  • PARI
    forprime(p=2, 1e4, if(p!=3, z=znorder(Mod(3, p)); if(z%2, print1(z, ", "))))

A385227 Odd multiplicative orders of 4 modulo primes.

Original entry on oeis.org

1, 3, 5, 9, 11, 5, 7, 23, 29, 33, 35, 9, 39, 41, 11, 51, 53, 7, 65, 69, 15, 81, 83, 89, 95, 99, 105, 37, 113, 29, 119, 25, 131, 135, 35, 47, 51, 155, 15, 21, 173, 179, 183, 189, 191, 209, 43, 73, 221, 231, 233, 239, 243, 245, 83, 251, 261, 273, 281, 57, 293
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

a(n) is the multiplicative order of 4 modulo A385221(n).
Odd elements in A082654.

Crossrefs

Cf. A082654, A385221 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), this sequence (base 4), A385193 (base 5), A385228 (base -2), A385229 (base -3), A385230 (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[4, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 28 2025 *)
  • PARI
    forprime(p=3, 1e4, z=znorder(Mod(4, p)); if(z%2, print1(z, ", ")))

A385228 Odd multiplicative orders of -2 modulo primes.

Original entry on oeis.org

1, 5, 9, 7, 29, 33, 41, 53, 65, 69, 81, 89, 105, 113, 25, 35, 47, 51, 15, 173, 189, 209, 221, 233, 245, 83, 261, 273, 281, 57, 293, 77, 309, 107, 329, 11, 115, 123, 393, 135, 413, 429, 441, 453, 473, 97, 509, 129, 131, 175, 545, 137, 561, 83, 585, 593, 149, 629, 641, 645, 653, 713, 725
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

a(n) is the multiplicative order of -2 modulo A163183(n).
Odd elements in A337878 (with first term changed to 1).

Crossrefs

Cf. A337878, A163183 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), A385227 (base 4), A385193 (base 5), this sequence (base -2), A385229 (base -3), A385230 (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[-2, #] &, Prime[Range[250]]], OddQ] (* Paolo Xausa, Jun 28 2025 *)
  • PARI
    forprime(p=3, 1e4, z=znorder(Mod(-2, p)); if(z%2, print1(z, ", ")))

A385229 Odd multiplicative orders of -3 modulo primes.

Original entry on oeis.org

1, 3, 9, 15, 9, 21, 5, 11, 39, 17, 63, 69, 25, 39, 81, 99, 105, 111, 15, 141, 17, 165, 87, 61, 93, 189, 99, 73, 231, 243, 83, 29, 7, 285, 303, 51, 103, 315, 107, 11, 345, 121, 369, 375, 131, 405, 411, 71, 429, 219, 63, 453, 153, 117, 161, 165, 83, 17, 519, 105, 531, 267, 543, 561, 117
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

Odd elements in A380482.
a(n) is the multiplicative order of -3 modulo A385223(n).

Crossrefs

Cf. A380482, A385223 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), A385227 (base 4), A385193 (base 5), A385228 (base -2), this sequence (base -3), A385230 (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[-3, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 30 2025 *)
  • PARI
    forprime(p=2, 1e4, if(p!=3, z=znorder(Mod(-3, p)); if(z%2, print1(z, ", "))))

A385230 Odd multiplicative orders of -4 modulo primes.

Original entry on oeis.org

1, 3, 7, 9, 5, 13, 15, 25, 9, 7, 17, 37, 13, 43, 45, 49, 19, 67, 23, 73, 39, 79, 87, 93, 97, 11, 51, 105, 19, 115, 127, 65, 135, 139, 71, 37, 153, 163, 165, 169, 175, 177, 61, 189, 95, 193, 199, 101, 205, 207, 213, 107, 219, 235, 17, 83, 23, 85, 265, 89, 91, 277, 279, 141, 59, 75
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

Odd elements in A380531.
a(n) is the multiplicative order of -4 modulo A385224(n).

Crossrefs

Cf. A380531, A385224 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), A385227 (base 4), A385193 (base 5), A385228 (base -2), A385229 (base -3), this sequence (base -4), A385231 (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[-4, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 30 2025 *)
  • PARI
    forprime(p=3, 1e4, z=znorder(Mod(-4, p)); if(z%2, print1(z, ", ")))

A385231 Odd multiplicative orders of -5 modulo primes.

Original entry on oeis.org

1, 1, 3, 11, 7, 21, 23, 15, 11, 41, 51, 53, 21, 27, 83, 111, 113, 57, 131, 141, 153, 173, 87, 61, 191, 105, 221, 7, 231, 233, 27, 251, 127, 5, 261, 273, 281, 293, 303, 107, 323, 165, 341, 175, 177, 363, 371, 19, 393, 205, 137, 59, 431, 63, 443, 453, 473, 483, 491, 177, 181, 551, 277, 187, 141
Offset: 1

Views

Author

Jianing Song, Jun 22 2025

Keywords

Comments

Odd elements in A380532.
a(n) is the multiplicative order of -5 modulo A385225(n).

Crossrefs

Cf. A380532, A385225 (corresponding primes).
Cf. other bases: A139686 (base 2), A385226 (base 3), A385227 (base 4), A385193 (base 5), A385228 (base -2), A385229 (base -3), A385230 (base -4), this sequence (base -5).

Programs

  • Mathematica
    Select[Map[MultiplicativeOrder[-5, #] &, Prime[Range[200]]], OddQ] (* Paolo Xausa, Jun 30 2025 *)
  • PARI
    forprime(p=2, 1e4, if(p!=5, z=znorder(Mod(-5, p)); if(z%2, print1(z, ", "))))

A103292 Numbers k such that sigma(2^k - 1) >= 2(2^k - 1), i.e., the number 2^k - 1 is perfect or abundant.

Original entry on oeis.org

12, 24, 36, 40, 48, 60, 72, 80, 84, 90, 96, 108, 120, 132, 140, 144, 156, 160, 168, 180, 192, 200, 204, 210, 216, 220, 228, 240, 252, 264, 270, 276, 280, 288, 300, 312, 320, 324, 330, 336, 348, 360, 372, 384, 396, 400, 408, 420, 432, 440, 444, 450, 456, 468, 480, 492, 504
Offset: 1

Views

Author

Max Alekseyev, Jan 28 2005

Keywords

Comments

Numbers k that 2^k - 1 is in A023196.
Are there any odd terms? This is a subsequence of A103291. Is the number 1 the only term where they differ? This is so if there is no least deficient number of the form 2^n-1 besides 1.
For each n in the sequence, 2n is also in the sequence: sigma[2^(2n)-1] = sigma[(2^n+1)(2^n-1)] >= (2^n+1)*sigma(2^n-1) because for each divisor d|2^n-1 there is (at least) the divisor (2^n+1)d |[(2^n+1)(2^n-1)]. Inserting sigma(2^n-1) >=2(2^n-1) yields (2^n+1)*sigma(2^n-1)>=(2^n+1)*2*(2^n-1)=2*[2^(2n)-1] qed. - R. J. Mathar, Aug 07 2007
From David Wasserman, May 16 2008: (Start)
Odd members exist. One such n is the lcm of the first 4416726 members of A139686, which has 6864499 digits. To show that n is a member, it's not necessary to exactly compute sigma(2^n-1).
The function f(x) = sigma(x)/x is multiplicative and has the property that for any a, b > 1, f(ab) > f(a). So it suffices to find some y such that f(y) >= 2 and y divides 2^n-1. In this case, y is the product of the first 4416726 members of A014663 and has 35260810 digits. (A014663(4416726) = 278379727.)
To see that this works, note that if a divides b, then 2^a-1 divides 2^b-1. For 1 <= i <= 4416726, A014663(i) divides 2^A139686(i)-1 by definition and A139686(i) divides n, so 2^A139686(i)-1 divides 2^n-1 and therefore A014663(i) divides 2^n-1. Then we can compute that f(y) = Product_{i = 1..4416726} (1 + 1/A014663(i)) is > 2.
The members of A014663 are the only primes that can divide 2^n-1 with n odd. Any powers of these primes are also possible divisors.
By including powers, we can construct a much smaller y. I found a y with 7057382 digits, omega(y) = 969004 and bigomega(y) = 969440. This y is close to the minimum possible. The least n such that y divides 2^n-1 is an odd number with 1472897 digits.
However, minimizing y is not the way to minimize n. We can get a smaller n by skipping primes p such that the order of 2 mod p is divisible by a large prime. This increases the number and size of the prime factors needed to make f(y) >= 2 and the time needed to find them.
The least odd n that I've found has 28375 digits. The corresponding y has 305621222 digits, omega(y) = 31903142 and bigomega(y) = 32796897. To find these prime factors, I searched up to A014663(96433108) = 7154804519.
I believe that the smallest odd member has between 10000 and 20000 digits, but the largest lower bound I can prove has 8 digits: f(p^i) is bounded above by 1 + 1/(p-1) and Product_{i=1..c} (1 + 1/(A014663(i)-1)) < 2 if c < 968858, so y must be at least Product_{i=1..968858} A014663(i), which has 7054790 digits.
Then n must be large enough that 2^n-1 >= y, yielding a lower bound of 23435503. I don't see any way to increase this significantly. (End)

Crossrefs

Programs

  • PARI
    for(i=1,1000,n=2^i-1;if(sigma(n)>=2*n,print(i)));

Extensions

Extended to a(32) by R. J. Mathar, Aug 07 2007
Terms from a(33) onwards from David Wasserman, May 16 2008
Showing 1-9 of 9 results.