A128344 -id:A128344 - cp's OEIS frontend

A128338 Numbers k such that (8^k + 5^k)/13 is prime.

7, 19, 167, 173, 223, 281, 21647

Offset: 1

Alexander Adamchuk, Feb 27 2007

All terms are primes.

a(8) > 10^5. - Robert Price, Jan 21 2013

Cf. A057171, A082387, A122853, A128335, A128336, A128337, A128339, A128340, A128341, A128342, A128343. Cf. A004061, A082182, A121877, A059802. Cf. A062572, A128344, A128345, A128346, A128347, A128348, A128349, A128350, A128351, A128352, A128353, A128354.

k=8; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n,1,100}]

is(n)=isprime((8^n+5^n)/13) \\ Charles R Greathouse IV, Feb 17 2017

a(7) from Robert Price, Jan 21 2013

A128343 Numbers k such that (14^k + 5^k)/19 is prime.

Original entry on oeis.org

3, 7, 17, 79, 17477, 19319, 49549

Offset: 1

Alexander Adamchuk, Feb 27 2007

All terms are primes.

a(8) > 10^5. - Robert Price, May 20 2013

Cf. A057171, A082387, A122853, A128335, A128336, A128337, A128338, A128339, A128340, A128341, A128342.
Cf. A004061, A082182, A121877, A059802.
Cf. A062572, A128344, A128345, A128346, A128347, A128348, A128349, A128350, A128351, A128352, A128353, A128354.

k=14; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n,1,100}]

is(n)=isprime((14^n+5^n)/19) \\ Charles R Greathouse IV, Feb 17 2017

a(5)-a(7) from Robert Price, May 20 2013

A213073 Numbers n such that (7^n - 4^n)/3 is prime.

Original entry on oeis.org

2, 5, 11, 61, 619, 2879, 2957, 24371, 69247, 376463, 571199, 624803

Offset: 1

Robert Price, Jun 04 2012

All terms are primes.

Next term > 10^6.

Jon Grantham and Andrew Granville, Fibonacci primes, primes of the form 2^n-k and beyond, arXiv:2307.07894 [math.NT], 2023.

Cf. A128344, A128024, A059802.

k=7; Do[p=Prime[n]; f=(k^p-4^p)/(k-4); If[ PrimeQ[f], Print[p] ], {n, 1, 100}]

is(n)=ispseudoprime((7^n-4^n)/3) \\ Charles R Greathouse IV, Jun 13 2017

a(10)-a(12) from Jon Grantham, Jul 29 2023

A247093 Triangle read by rows: T(m,n) = smallest odd prime p such that (m^p-n^p)/(m-n) is prime (0

Original entry on oeis.org

3, 3, 3, 0, 0, 3, 3, 5, 13, 3, 3, 0, 0, 0, 5, 5, 3, 3, 5, 3, 3, 3, 0, 3, 0, 19, 0, 7, 0, 3, 0, 0, 3, 0, 3, 7, 19, 0, 3, 0, 0, 0, 31, 0, 3, 17, 5, 3, 3, 5, 3, 5, 7, 5, 3, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 5, 3, 7, 5, 5, 3, 7, 3, 3, 251, 3, 17, 3, 0, 5, 0, 151, 0, 0, 0, 59, 0, 5, 0, 3, 3, 5, 0, 1097, 0, 0, 3, 3, 0, 0, 7, 0, 17, 3

Offset: 1

Eric Chen, Nov 18 2014

T(m,n) is 0 if and only if m and n are not coprime or A052409(m) and A052409(n) are not coprime. (The latter has some exceptions, like T(8,1) = 3. In fact, if p is a prime and does not equal to A052410(gcd(A052409(m),A052409(n))), then (m^p-n^p)/(m-n) is composite, so if it is not 0, then it is A052410(gcd(A052409(m),A052409(n))).) - Eric Chen, Nov 26 2014
a(i) = T(m,n) corresponds only to probable primes for (m,n) = {(15,4), (18,1), (19,18), (31,6), (37,22), (37,25), ...} (i={95, 137, 171, 441, 652, 655, ...}). With the exception of these six (m,n), all corresponding primes up to a(663) are definite primes. - Eric Chen, Nov 26 2014
a(n) is currently known up to n = 663, a(664) = T(37, 34) > 10000. - Eric Chen, Jun 01 2015
For n up to 1000, a(n) is currently unknown only for n = 664, 760, and 868. - Eric Chen, Jun 01 2015

			Read by rows:
m\n        1   2   3   4   5   6   7   8   9   10  11
2          3
3          3   3
4          0   0   3
5          3   5   13  3
6          3   0   0   0   5
7          5   3   3   5   3   3
8          3   0   3   0   19  0   7
9          0   3   0   0   3   0   3   7
10         19  0   3   0   0   0   31  0   3
11         17  5   3   3   5   3   5   7   5   3
12         3   0   0   0   3   0   3   0   0   0   3
etc.

Eric Chen, Table of n, a(n) for n = 1..663
Eric Chen, Table of n, a(n) for n = 1..1000 status

Cf. A128164 (n,1), A125713 (n+1,n), A125954 (2n+1,2), A122478 (2n+1,2n-1).

Cf. A000043 (2,1), A028491 (3,1), A057468 (3,2), A059801 (4,3), A004061 (5,1), A082182 (5,2), A121877 (5,3), A059802 (5,4), A004062 (6,1), A062572 (6,5), A004063 (7,1), A215487 (7,2), A128024 (7,3), A213073 (7,4), A128344 (7,5), A062573 (7,6), A128025 (8,3), A128345 (8,5), A062574 (8,7), A173718 (9,2), A128346 (9,5), A059803 (9,8), A004023 (10,1), A128026 (10,3), A062576 (10,9), A005808 (11,1), A210506 (11,2), A128027 (11,3), A216181 (11,4), A128347 (11,5), A062577 (11,10), A004064 (12,1), A128348 (12,5), A062578 (12,11).

t1[n_] := Floor[3/2 + Sqrt[2*n]]
m[n_] := Floor[(-1 + Sqrt[8*n-7])/2]
t2[n_] := n-m[n]*(m[n]+1)/2
b[n_] := GCD @@ Last /@ FactorInteger[n]
is[m_, n_] := GCD[m, n] == 1 && GCD[b[m], b[n]] == 1
Do[k=2, If[is[t1[n], t2[n]], While[ !PrimeQ[t1[n]^Prime[k] - t2[n]^Prime[k]], k++]; Print[Prime[k]], Print[0]], {n, 1, 663}] (* Eric Chen, Jun 01 2015 *)

a052409(n) = my(k=ispower(n)); if(k, k, n>1);
a(m, n) = {if (gcd(m,n) != 1, return (0)); if (gcd(a052409(m), a052409(n)) != 1, return (0)); forprime(p=3,, if (isprime((m^p-n^p)/(m-n)), return (p)););}
tabl(nn) = {for (m=2, nn, for(n=1, m-1, print1(a(m,n), ", ");); print(););} \\ Michel Marcus, Nov 19 2014

t1(n)=floor(3/2+sqrt(2*n))
t2(n)=n-binomial(floor(1/2+sqrt(2*n)), 2)
b(n)=my(k=ispower(n)); if(k, k, n>1)
a(n)=if(gcd(t1(n),t2(n)) !=1 || gcd(b(t1(n)), b(t2(n))) !=1, 0, forprime(p=3,2^24,if(ispseudoprime((t1(n)^p-t2(n)^p)/(t1(n)-t2(n))), return(p)))) \\ Eric Chen, Jun 01 2015

A376329 Numbers k such that (45^k - 2^k)/43 is prime.

Original entry on oeis.org

2, 7, 89, 167, 8101, 96517

Offset: 1

Robert Price, Nov 19 2024

The definition implies that k must be a prime.

a(7) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236, A377031.

Select[Prime[Range[10000]], PrimeQ[(45^# - 2^#)/43] &]

A376470 Numbers k such that (29^k - 2^k)/27 is prime.

Original entry on oeis.org

2, 7, 139, 983, 3257, 10181, 26387, 36187, 42557

Offset: 1

Robert Price, Sep 24 2024

The definition implies that k must be a prime.

a(10) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236.

Select[Prime[Range[1000]], PrimeQ[(29^# - 2^#)/27] &]

A377180 Numbers k such that (43^k - 2^k)/41 is prime.

Original entry on oeis.org

167, 797, 1009, 54941

Offset: 1

Robert Price, Oct 18 2024

The definition implies that k must be a prime.

a(5) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236, A377031.

Select[Prime[Range[10000]], PrimeQ[(43^# - 2^#)/41] &]

A377699 Numbers k such that (35^k - 2^k)/33 is prime.

Original entry on oeis.org

2, 17, 53, 211, 4013, 55207

Offset: 1

Robert Price, Nov 05 2024

The definition implies that k must be a prime.

a(7) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236, A377031.

Select[Prime[Range[10000]], PrimeQ[(35^# - 2^#)/33] &]

A377718 Numbers k such that (41^k - 2^k)/39 is prime.

Original entry on oeis.org

2, 41, 97, 131, 2411, 7321

Offset: 1

Robert Price, Nov 04 2024

The definition implies that k must be a prime.

a(7) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236, A377031.

Select[Prime[Range[10000]], PrimeQ[(41^# - 2^#)/39] &]

A377779 Numbers k such that (31^k - 2^k)/29 is prime.

Original entry on oeis.org

5, 17, 541, 701, 769

Offset: 1

Robert Price, Nov 06 2024

The definition implies that k must be a prime.

a(6) > 10^5.

P. Bourdelais, A Generalized Repunit Conjecture.
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A229542, A375161, A375236, A377031.

Select[Prime[Range[10000]], PrimeQ[(31^# - 2^#)/29] &]

cp's OEIS Frontend

A128338 Numbers k such that (8^k + 5^k)/13 is prime.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A128343 Numbers k such that (14^k + 5^k)/19 is prime.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A213073 Numbers n such that (7^n - 4^n)/3 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A247093 Triangle read by rows: T(m,n) = smallest odd prime p such that (m^p-n^p)/(m-n) is prime (0

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A376329 Numbers k such that (45^k - 2^k)/43 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A376470 Numbers k such that (29^k - 2^k)/27 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A377180 Numbers k such that (43^k - 2^k)/41 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A377699 Numbers k such that (35^k - 2^k)/33 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica