A076845 -id:A076845 - cp's OEIS frontend

A076846 Primes of the form n^k + n - 1, where k>0 is minimal.

3, 5, 7, 29, 11, 13, 71, 17, 19, 131, 23, 181, 2177953337809371149, 29, 31, 83537, 5849, 37, 419, 41, 43, 279863, 47, 15649, 701, 53, 811, 420707233300229, 59, 61

Offset: 2

Benoit Cloitre, Nov 20 2002

nonn

The next term is too large to include.

Reinhard Zumkeller, Table of n, a(n) for n = 2..100

Cf. A076845, A078179, A010051, A002327.

a076846 n = n ^ (a076845 n) + n - 1
-- Reinhard Zumkeller, Jul 17 2014

Offset corrected by Reinhard Zumkeller, Jul 17 2014

A078178 Least k>=2 such that n^k + n - 1 is prime.

Original entry on oeis.org

2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 4, 2, 16, 2, 2, 4, 3, 2, 2, 2, 7, 4, 2, 3, 2, 3, 2, 10, 2, 2, 108, 3, 6, 2, 3, 7, 2, 2, 4, 2, 16, 3, 2, 2, 2, 20, 2, 7, 2, 3, 3, 2, 2, 2, 2, 9, 4, 2, 2, 7, 8, 3, 2, 2, 2, 24, 2, 6, 2, 12, 4, 3, 8, 6, 2, 4, 3, 9, 194, 3, 13, 2, 8, 2, 2, 3, 8, 2, 10, 6, 4, 2, 2, 54, 2, 132, 4, 10, 2

Offset: 2

Reinhard Zumkeller, Nov 20 2002

nonn

n^a(n) + n - 1 = A078179(n).

			7^2+7-1=5*11, but 7^3+7-1=349=A000040(70), therefore a(7)=3.

Cf. A076845, A078179.

Cf. A010051.

a078178 n = head [k | k <- [2..], a010051'' (n ^ k + n - 1) == 1]
-- Reinhard Zumkeller, Jul 16 2014

lkp[n_]:=Module[{k=2},While[!PrimeQ[n^k+n-1],k++];k]; Array[lkp,100,2] (* Harvey P. Dale, May 24 2020 *)

More terms from Benoit Cloitre, Nov 20 2002

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

Eric Chen, Jun 04 2018

nonn

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.

Eric Chen, Table of n, a(n) for n = 2..122
Gary Barnes, Sierpinski conjectures and proofs
Eric Chen, Table n, a(n) for n = 2..360 status

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)
--------------------------------------------------------------------
   2 A000043 ------- A002235 A002253 A000043 ------- A050414 A057732
   3 A003307 A003306 A005540 A005537 A014224 A051783 A058959 A058958
   4 A272057 ------- ------- xxxxxxx A059266 A089437 A217348 xxxxxxx
   5 A046865 A204322 A257790 A143279 A059613 A124621 A165701 A089142
   6 A079906 A247260 ------- ------- A059614 A145106 A217352 A217351
   7 A046866 A245241 ------- xxxxxxx A191469 A217130 A217131 xxxxxxx
   8 A268061 A269544 ------- ------- A217380 A217381 A217383 A217382
   9 A268356 A056799 ------- ------- A177093 A217385 A217493 A217492
  10 A056725 A056797 A111391 xxxxxxx A095714 A088275 A092767 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)).

a(n)=for(k=1,2^16,if(ispseudoprime((n-1)*n^k+1),return(k)))

cp's OEIS Frontend

A076846 Primes of the form n^k + n - 1, where k>0 is minimal.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Extensions

A078178 Least k>=2 such that n^k + n - 1 is prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Haskell

Mathematica

Extensions

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI