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.

Previous Showing 11-13 of 13 results.

A245241 Integers n such that 6 * 7^n + 1 is prime.

Original entry on oeis.org

0, 1, 4, 9, 99, 412, 2633, 5093, 5632, 28233, 36780, 47084, 53572
Offset: 1

Views

Author

Robert Price, Nov 14 2014

Keywords

Comments

All terms correspond to verified primes, that is, not merely probable primes.
a(14) > 2*10^5.

Examples

			4 is in this sequence because 6 * 7^4 + 1 = 14407, which is prime.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[0,200000], PrimeQ[6 * 7^# + 1] &]

A385115 Numbers k such that 2^4 * 3^k - 1 is prime.

Original entry on oeis.org

1, 3, 9, 13, 31, 43, 81, 121, 235, 1135, 1245, 1521, 2019, 2329, 3573, 11245, 15571, 37333, 54471, 70641
Offset: 1

Views

Author

Ken Clements, Aug 14 2025

Keywords

Comments

All terms are odd, since if k were even, N = 2^4 * 3^k would be a perfect square and N - 1 could be factored as the difference of squares, hence not prime.
a(21) > 10^5. - Michael S. Branicky, Aug 15 2025

Crossrefs

Programs

  • Mathematica
    Select[Range[4000], PrimeQ[16 * 3^# - 1] &] (* Amiram Eldar, Aug 15 2025 *)
  • Python
    from gmpy2 import is_prime
    print([k for k in range(1, 4_000, 2) if is_prime(16 * 3**k - 1)])

Extensions

a(17)-a(20) from Michael S. Branicky, Aug 15 2025

A387197 Numbers k such that 32 * 3^k - 1 is prime.

Original entry on oeis.org

0, 3, 4, 6, 46, 59, 84, 94, 124, 239, 267, 366, 371, 424, 616, 2139, 2299, 3523, 3563, 3843, 3923, 7627, 12751, 34798, 39911, 56568, 58779
Offset: 1

Views

Author

Ken Clements, Aug 21 2025

Keywords

Comments

a(28) > 10^5.
Conjecture: This sequence intersects with A387201 at k = 4 to form twin primes with center N = 2^5 * 3^4 = 2592 = A027856(10). Any such intersection has to be at an even k because if k is odd, either N-1 or N+1 has to be divisible by 5. A covering system can be constructed that eliminates all other intersections except where k = 4(mod 60), and for k > 4 with k = 4(mod 60), the search up to 10^5 makes the probability of another intersection in this residue class vanishingly small.

Crossrefs

Programs

  • Mathematica
    Select[Range[0, 4000], PrimeQ[32 * 3^# - 1] &] (* Amiram Eldar, Aug 21 2025 *)
  • Python
    from gmpy2 import is_prime
    print([ k for k in range(4000) if is_prime(32 * 3**k - 1)])
Previous Showing 11-13 of 13 results.