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

A056799 Numbers n such that 8*9^n +1 is prime.

Original entry on oeis.org

1, 4, 5, 11, 26, 29, 38, 65, 166, 490, 641, 2300, 9440, 44741, 65296, 161930, 586240
Offset: 1

Views

Author

Robert G. Wilson v, Aug 22 2000

Keywords

Comments

The even members of A005538, halved. - Jeppe Stig Nielsen, Oct 13 2019

Crossrefs

Cf. A005538.

Programs

  • Mathematica
    Do[If[PrimeQ[8*9^n + 1], Print[n]], {n, 0, 1000}]
    Select[Range[3000], PrimeQ[8 9^# + 1] &] (* Vincenzo Librandi, Sep 28 2012 *)
  • PARI
    is(n)=ispseudoprime(8*9^n+1) \\ Charles R Greathouse IV, Mar 01 2017

Extensions

a(12) from Vincenzo Librandi, Sep 28 2012
a(13)-a(16) from Robert Price, Feb 22 2016
a(17) from Paul S. Vanderveen, Jul 04 2020

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] &]

A387060 Numbers k such that 16 * 3^k + 1 is prime.

Original entry on oeis.org

0, 3, 4, 5, 12, 24, 36, 77, 195, 296, 297, 533, 545, 644, 884, 932, 1409, 2061, 2453, 2985, 3381, 4980, 5393, 11733, 13631, 14516, 21004, 27663, 32645, 39453, 67055, 90543
Offset: 1

Views

Author

Ken Clements, Aug 15 2025

Keywords

Comments

a(33) > 10^5.
Conjecture: The only intersection with A385115 is at k = 3 where 2^4 * 3^3 = 432 = A027856(8).
Idea: For odd k > 3, covering systems ensure mutual exclusion:
If k = 1, 9, 13, 19, 25, 31, 37, 39, 43, 49, 55 (mod 60), then 7 or 31 divides (16*3^k+1).
If k = 5, 7, 11, 17, 23, 27, 29, 35, 41, 47, 53, 57, 59 (mod 60), then 11 or 13 divides (16*3^k-1).
If k = 15, 21, 33, 45, 51 (mod 60), various primes including {11,31,43,109,277,433,...} ensure at least one of 16*3^k +- 1 is composite.
If k = 3 (mod 60) and k > 3, the probability of intersection becomes vanishingly small.
Only k = 3 escapes all divisibility conditions. Verified to k = 10^5.

Crossrefs

Programs

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

A216888 Numbers k such that 6*3^k + 1 is prime.

Original entry on oeis.org

0, 1, 3, 4, 5, 8, 15, 16, 29, 53, 56, 59, 64, 131, 179, 319, 695, 781, 821, 896, 1251, 1453, 4216, 5479, 6224, 7841, 12095, 13781, 17719, 43955, 64821, 82779, 105105, 152528, 165895, 191813, 529679, 1074725, 1086111, 1175231, 1277861, 1346541, 3123035, 3648968, 5570080, 6236771, 10852676
Offset: 1

Views

Author

Vincenzo Librandi, Sep 26 2012

Keywords

Examples

			3 is a term because 6*3^3 + 1 = 163 is prime.
7 is not a term because 6*3^7 + 1 = 13123 = 11*1193 is composite.
		

Crossrefs

Associated primes are in A111974.

Programs

  • Magma
    /* Gives only the terms up to 1453: */ [n: n in [0..1500] | IsPrime(6*3^n + 1)];
    
  • Mathematica
    Select[Range[5000], PrimeQ[6 3^# + 1] &]
  • PARI
    is(n)=ispseudoprime(6*3^n+1) \\ Charles R Greathouse IV, Jun 13 2017

Formula

a(n) = A003306(n+1)-1. - Bruno Berselli, Sep 27 2012

Extensions

More terms from Vincenzo Librandi, Oct 01 2012
a(41)-a(47) from the data at A003306 added by Amiram Eldar, Jul 18 2025

A387201 Numbers k such that 32 * 3^k + 1 is prime.

Original entry on oeis.org

1, 4, 8, 9, 32, 36, 48, 74, 112, 186, 204, 364, 393, 572, 781, 1208, 2624, 2778, 4522, 4896, 5272, 32884
Offset: 1

Views

Author

Ken Clements, Aug 21 2025

Keywords

Comments

a(23) > 10^5.
Conjecture: This sequence intersects with A387197 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, 5000], 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)])
Showing 1-5 of 5 results.