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

A177331 Prime numbers p such that (p*2^k-1)/3 is composite for all even k or all odd k.

Original entry on oeis.org

557, 743, 919, 1163, 3257, 3301, 4817, 5209, 5581, 6323, 6421, 6983, 7457, 7793
Offset: 1

Views

Author

T. D. Noe, May 08 2010

Keywords

Comments

This sequence consists of the primes >3 for which A177330 is zero. k is even when p=1 (mod 6); k is odd when p=5 (mod 6). This problem is similar to that of finding Sierpinski and Riesel numbers (see A076336 and A076337). Compositeness of (p*2^k-1)/3 for all even or all odd k is established by finding a finite set of primes such that at least one member of the set divides each term. For p <= 7797, the set of primes is {3,5,7,13}.

A225424 Least prime p such that prime(n) is the next prime number in the Collatz (3x+1) iteration of p, or 0 if there is no such prime.

Original entry on oeis.org

5, 0, 3, 37, 7, 17, 11, 101, 61, 19, 41, 197, 109, 229, 31
Offset: 1

Views

Author

T. D. Noe, May 22 2013

Keywords

Comments

The next term, surprisingly, is the 2743-digit (53 * 2^9107 - 1)/3. See A177331 for additional prime numbers, besides 3, that are not in the Collatz iteration of any prime number.

Examples

			a(4) = 37 because the Collatz iteration of 37 is {37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1}, which shows that 7 is the next prime after 37.
		

Crossrefs

Programs

  • Mathematica
    Table[p = Prime[n]; If[p == 3, q = 0, k = 1; While[q = (p*2^k - 1)/3; k < 10000 && ! PrimeQ[q], k++]]; q, {n, 15}]

A276357 Primes of the form (p*2^x-1)/3, where p is also prime and x is a positive integer.

Original entry on oeis.org

3, 5, 7, 11, 13, 17, 19, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71, 89, 97, 101, 109, 127, 131, 137, 149, 151, 157, 167, 179, 181, 197, 211, 229, 239, 241, 257, 269, 277, 281, 307, 311, 347, 349, 379, 389, 397, 409, 421, 431, 439, 449, 461, 467, 479, 509, 547, 571, 577, 587
Offset: 1

Views

Author

Michael Cader Nelson, Aug 31 2016

Keywords

Comments

Relationship to Collatz (3x+1) problem: when one of these primes appears in a hailstone sequence, the next odd number in the sequence must be prime. - Michael Cader Nelson, Jul 03 2020

Examples

			3 is in the sequence because 3 = (5*2^1-1)/3 and both 3 and 5 are prime numbers; while 23 is not in the sequence because the only positive integer values (p,x) to give 23 are (35,1) and 35 is not prime.
		

Crossrefs

Cf. A087273, A087963. A177330 (lists all exponents x).

Programs

  • Mathematica
    mx = 590; Select[ Sort@ Flatten@ Table[(Prime[p]*2^x - 1)/3, {x, Log2[mx/3]}, {p, PrimePi[3 mx/2^x]}], PrimeQ] (* Robert G. Wilson v, Nov 01 2016 *)
  • PARI
    lista(nn) = {forprime(p=2, nn, z = 3*p+1; x = valuation(z, 2); for (ex = 1, x, if (isprime(z/2^ex), print1(p, ", "); break;);););} \\ Michel Marcus, Sep 01 2016

Formula

The value of p is (3*a(n)+1)/2^x as well as the respective term in A087273 evaluated for a(n), while the value of x is the related exponent in A087963 unless 3*a(n)+1 is a power of 2 (e.g., n = 1).

Extensions

Corrected and extended by Michel Marcus, Sep 01 2016
Showing 1-3 of 3 results.