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-2 of 2 results.

A272475 Numbers n such that 2^n-1 and 3^n-1 are not coprime.

Original entry on oeis.org

4, 6, 8, 10, 11, 12, 16, 18, 20, 22, 23, 24, 28, 30, 32, 33, 35, 36, 40, 42, 43, 44, 46, 48, 50, 52, 54, 55, 56, 58, 60, 64, 66, 68, 69, 70, 72, 75, 76, 77, 78, 80, 82, 83, 84, 86, 88, 90, 92, 95, 96, 99, 100, 102, 104, 105, 106, 108, 110, 112, 114, 115, 116, 117
Offset: 1

Views

Author

Vincenzo Librandi, May 01 2016

Keywords

Comments

Complement of A263647.

Examples

			gcd(2^4-1, 3^4-1) = gcd(15,80) = 5, so a(1) = 4.
		

Crossrefs

Cf. A263647.

Programs

  • Magma
    [n: n in [1..200] | not Gcd(2^n-1, 3^n-1) eq 1];
    
  • Mathematica
    Select[Range[200], ! GCD[2^# - 1, 3^# - 1] == 1 &]
  • PARI
    isok(n) = gcd(2^n-1, 3^n-1) != 1; \\ Michel Marcus, May 01 2016

A265166 Numbers n such that 2^n-1 and 5^n-1 are coprime.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 33, 37, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 77, 79, 81, 83, 85, 87, 89, 91, 93, 97, 101, 103, 107, 109, 111, 113, 115, 121, 123, 125, 127, 129, 131, 133, 137, 139, 141, 143
Offset: 1

Views

Author

Vincenzo Librandi, May 01 2016

Keywords

Comments

Also numbers n such that A270390(n) = 1.
Conjectured to be infinite: see the Ailon and Rudnick paper.

Examples

			gcd(2^1-1, 5^1-1) = gcd(1,4) = 1, so a(1) = 1.
gcd(2^3-1, 5^3-1) = gcd(7,124) = 1, so a(2) = 3.
gcd(2^4-1, 5^4-1) = gcd(15,624) = 3, so 4 is not in the sequence.
		

Crossrefs

Programs

  • Magma
    [n: n in [1..200] | Gcd(2^n-1,5^n-1) eq 1];
  • Mathematica
    Select[Range[200], GCD[2^# - 1, 5^# - 1] == 1 &]
    Select[Range[150],CoprimeQ[2^#-1,5^#-1]&] (* Harvey P. Dale, Apr 12 2018 *)
Showing 1-2 of 2 results.