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

A191469 Numbers n such that 7^n - 6 is prime.

Original entry on oeis.org

2, 3, 6, 9, 21, 25, 33, 49, 54, 133, 245, 255, 318, 1023, 1486, 3334, 6821, 8555, 11605, 42502, 44409, 90291, 92511, 140303
Offset: 1

Views

Author

Vincenzo Librandi, Jun 06 2011

Keywords

Comments

a(14)=1023 and a(15)=1486 correspond to BPSW strong probable primes (passing PARI's ispseudoprime()). - Joerg Arndt, Jun 06 2011
a(25) > 2*10^5. - Robert Price, Nov 14 2014

Crossrefs

Programs

  • Magma
    [n: n in [1..1000]| IsPrime(7^n-6)]
    
  • Maple
    A191469:=n->`if`(isprime(7^n-6),n,NULL): seq(A191469(n), n=1..10^3); # Wesley Ivan Hurt, Nov 14 2014
  • Mathematica
    Select[Range[1,5000],PrimeQ[7^#-6]&] (* Vincenzo Librandi, Aug 05 2012 *)
  • PARI
    for(n=1, 10^6, if(isprime(7^n-6), print1(n, ", ")))

Extensions

a(17)-a(23) from Robert Price, Jan 24 2014
a(24) from Robert Price, Nov 14 2014

A177094 Primes of the form 3^(2n) - 8.

Original entry on oeis.org

73, 6553, 4782961, 3486784393, 31381059601, 381520424476945831628649898801
Offset: 1

Views

Author

Vincenzo Librandi, Nov 15 2010

Keywords

Crossrefs

Cf. A177093.

Programs

  • Magma
    [a: n in [1..200] | IsPrime(a) where a is(3^(2*n)-2^3)];
  • Mathematica
    Select[Table[(3^(2 n) - 2^3), {n, 1, 200}], PrimeQ] (* Vincenzo Librandi, Jan 03 2014 *)

A217385 Numbers n such that 9^n + 8 is prime.

Original entry on oeis.org

1, 2, 4, 7, 10, 19, 22, 44, 62, 76, 122, 2191, 3134, 9244, 40999, 48230
Offset: 1

Views

Author

Vincenzo Librandi, Oct 04 2012

Keywords

Comments

Contains exactly the halved even terms of A217136. - Bruno Berselli, Oct 04 2012

Crossrefs

Programs

  • Mathematica
    Select[Range[5000], PrimeQ[9^# + 8] &]
  • PARI
    is(n)=ispseudoprime(9^n+8) \\ Charles R Greathouse IV, Jun 13 2017

Extensions

a(14) from Bruno Berselli, Oct 05 2012
a(15)-a(16) derived from A217136 by Robert Price, May 19 2015

A305531 Smallest k >= 1 such that (n-1)*n^k + 1 is prime.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 1, 3, 10, 3, 1, 2, 1, 1, 4, 1, 29, 14, 1, 1, 14, 2, 1, 2, 4, 1, 2, 4, 5, 12, 2, 1, 2, 2, 9, 16, 1, 2, 80, 1, 2, 4, 2, 3, 16, 2, 2, 2, 1, 15, 960, 15, 1, 4, 3, 1, 14, 1, 6, 20, 1, 3, 946, 6, 1, 18, 10, 1, 4, 1, 5, 42, 4, 1, 828, 1, 1, 2, 1, 12, 2, 6, 4, 30, 3, 3022, 2, 1, 1
Offset: 2

Views

Author

Eric Chen, Jun 04 2018

Keywords

Comments

a(prime(j)) + 1 = A087139(j).
a(123) > 10^5, a(342) > 10^5, see the Barnes link for the Sierpinski base-123 and base-342 problems.
a(251) > 73000, see A087139.

Crossrefs

For the numbers k such that these forms are prime:
a1(b): numbers k such that (b-1)*b^k-1 is prime
a2(b): numbers k such that (b-1)*b^k+1 is prime
a3(b): numbers k such that (b+1)*b^k-1 is prime
a4(b): numbers k such that (b+1)*b^k+1 is prime (no such k exists when b == 1 (mod 3))
a5(b): numbers k such that b^k-(b-1) is prime
a6(b): numbers k such that b^k+(b-1) is prime
a7(b): numbers k such that b^k-(b+1) is prime
a8(b): numbers k such that b^k+(b+1) is prime (no such k exists when b == 1 (mod 3)).
Using "-------" if there is currently no OEIS sequence and "xxxxxxx" if no such k exists (this occurs only for a4(b) and a8(b) for b == 1 (mod 3)):
.
b a1(b) a2(b) a3(b) a4(b) a5(b) a6(b) a7(b) a8(b)
--------------------------------------------------------------------
4 A272057 ------- ------- xxxxxxx A059266 A089437 A217348 xxxxxxx
7 A046866 A245241 ------- xxxxxxx A191469 A217130 A217131 xxxxxxx
11 A046867 A057462 ------- ------- ------- ------- ------- -------
12 A079907 A251259 ------- ------- ------- A137654 ------- -------
13 A297348 ------- ------- xxxxxxx ------- ------- ------- xxxxxxx
14 A273523 ------- ------- ------- ------- ------- ------- -------
15 ------- ------- ------- ------- ------- ------- ------- -------
16 ------- ------- ------- xxxxxxx ------- ------- ------- xxxxxxx
Cf. (smallest k such that these forms are prime) A122396 (a1(b)+1 for prime b), A087139 (a2(b)+1 for prime b), A113516 (a5(b)), A076845 (a6(b)), A178250 (a7(b)).

Programs

  • PARI
    a(n)=for(k=1,2^16,if(ispseudoprime((n-1)*n^k+1),return(k)))
Showing 1-4 of 4 results.