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.

A274987 Primes p such that A274601(p) is a prime.

Original entry on oeis.org

3, 5, 7, 11, 13, 17, 23, 31, 37, 53, 59, 61, 73, 79, 83, 89, 101, 103, 109, 127, 137, 139, 149, 173, 179, 193, 223, 229, 257, 263, 293, 307, 313, 337, 347, 349, 359, 367, 389, 397, 409, 419, 439, 449, 461, 467, 487, 491, 521, 547, 571, 577, 599, 601, 619, 631
Offset: 1

Views

Author

Lei Zhou, Nov 11 2016

Keywords

Comments

It is conjectured that the sequence is infinite.
This sequence is also the list of primes with k trits that are used in decomposition of 2*3^k into the sum of such two primes. k>=1.

Examples

			For p=2, A274601(p) = 4, which is not a prime, so ignore 2.
For p=3, A274601(p) = 3, which is a prime, so a(1)=3.
For p=5, A274601(p) = 13, which is a prime, so a(2)=5.
		

Crossrefs

Programs

  • Mathematica
    p = 2; Table[While[p = NextPrime[p]; cp = 2*3^(Floor[Log[3, 2*p - 1]]) - p; !PrimeQ[cp]]; p, {n, 1, 56}]