A228034 -id:A228034 - cp's OEIS frontend

A228026 Primes of the form 4^k + 3.

7, 19, 67, 4099, 65539, 262147, 268435459, 1073741827, 19342813113834066795298819

Offset: 1

Vincenzo Librandi, Aug 11 2013

			67 is a term because 4^3 + 3 = 67 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..16

Cf. A089437 (associated k).

Cf. Primes of the form r^k + h: A092506 (r=2, h=1), A057733 (r=2, h=3), A123250 (r=2, h=5), A104066 (r=2, h=7), A104070 (r=2, h=9), A057735 (r=3, h=2), A102903 (r=3, h=4), A102870 (r=3, h=8), A102907 (r=3, h=10), A290200 (r=4, h=1), this sequence (r=4, h=3), A228027 (r=4, h=9), A182330 (r=5, h=2), A228029 (r=5, h=6), A102910 (r=5, h=8), A182331 (r=6, h=1), A104118 (r=6, h=5), A104115 (r=6, h=7), A104065 (r=7, h=4), A228030 (r=7, h=6), A228031 (r=7, h=10), A228032 (r=8, h=3), A228033 (r=8, h=5), A144360 (r=8, h=7), A145440 (r=8, h=9), A228034 (r=9, h=2), A159352 (r=10, h=3), A159031 (r=10, h=7).

[a: n in [0..200] | IsPrime(a) where a is  4^n+3];

Select[Table[4^n + 3, {n, 0, 200}], PrimeQ]

a(n) = 4^A089437(n) + 3. - Elmo R. Oliveira, Nov 14 2023

Cross-references corrected by Robert Price, Aug 01 2017

A228032 Primes of the form 8^n + 3.

Original entry on oeis.org

11, 67, 4099, 32771, 262147, 1073741827, 19342813113834066795298819

Offset: 1

Vincenzo Librandi, Aug 11 2013

Vincenzo Librandi, Table of n, a(n) for n = 1..14

Cf. A217354 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A182330 (k=5, h=2), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), this sequence (k=8, h=3), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [0..300] | IsPrime(a) where a is  8^n+3];

Select[Table[8^n + 3, {n, 0, 300}], PrimeQ]

Corrected cross-references - Robert Price, Aug 01 2017

A228029 Primes of the form 5^n + 6.

Original entry on oeis.org

7, 11, 31, 131, 631, 1220703131

Offset: 1

Vincenzo Librandi, Aug 11 2013

Vincenzo Librandi, Table of n, a(n) for n = 1..15

Cf. A089142 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A182330 (k=5, h=2), this sequence (k=5, h=6), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [0..200] | IsPrime(a) where a is  5^n+6];

Select[Table[5^n + 6, {n, 0, 200}], PrimeQ]

Corrected cross-references - Robert Price, Aug 01 2017

A228030 Primes of the form 7^n + 6.

Original entry on oeis.org

7, 13, 349, 33232930569607, 2651730845859653471779023381607

Offset: 1

Vincenzo Librandi, Aug 11 2013

Vincenzo Librandi, Table of n, a(n) for n = 1..7

Cf. A217130 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A182330 (k=5, h=2), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), this sequence (k=7, h=6), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [0..300] | IsPrime(a) where a is  7^n+6];

Select[Table[7^n + 6, {n, 0, 300}], PrimeQ]

Corrected cross-references - Robert Price, Aug 01 2017

A228031 Primes of the form 7^n + 10.

Original entry on oeis.org

11, 17, 59, 353, 2411, 117659, 823553, 1977326753, 9387480337647754305659, 3219905755813179726837617, 44567640326363195900190045974568017, 616873509628062366290756156815389726793178417, 30226801971775055948247051683954096612865741953

Offset: 1

Vincenzo Librandi, Aug 11 2013

Vincenzo Librandi, Table of n, a(n) for n = 1..21

Cf. A217132 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A182330 (k=5, h=2), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), this sequence (k=7, h=10), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [0..300] | IsPrime(a) where a is  7^n+10];

Select[Table[7^n + 10, {n, 0, 300}], PrimeQ]

Corrected cross-references - Robert Price, Aug 01 2017

A228027 Primes of the form 4^k + 9.

Original entry on oeis.org

13, 73, 1033, 262153, 1073741833, 73786976294838206473, 4835703278458516698824713

Offset: 1

Vincenzo Librandi, Aug 11 2013

Subsequence of A104070. - Elmo R. Oliveira, Nov 28 2023

			262153 is a term because 4^9 + 9 = 262153 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..12

Cf. A000040, A217350 (corresponding k's).

Cf. Primes of the form r^k + h: A092506 (r=2, h=1), A057733 (r=2, h=3), A123250 (r=2, h=5), A104066 (r=2, h=7), A104070 (r=2, h=9), A057735 (r=3, h=2), A102903 (r=3, h=4), A102870 (r=3, h=8), A102907 (r=3, h=10), A290200 (r=4, h=1), A228026 (r=4, h=3), this sequence (r=4, h=9), A182330 (r=5, h=2), A228029 (r=5, h=6), A102910 (r=5, h=8), A182331 (r=6, h=1), A104118 (r=6, h=5), A104115 (r=6, h=7), A104065 (r=7, h=4), A228030 (r=7, h=6), A228031 (r=7, h=10), A228032 (r=8, h=3), A228033 (r=8, h=5), A144360 (r=8, h=7), A145440 (r=8, h=9), A228034 (r=9, h=2), A159352 (r=10, h=3), A159031 (r=10, h=7).

[a: n in [0..200] | IsPrime(a) where a is 4^n+9];

Select[Table[4^n + 9, {n, 0, 200}],PrimeQ]

a(n) = 4^A217350(n) + 9. - Elmo R. Oliveira, Nov 28 2023

Corrected cross-references - Robert Price, Aug 01 2017

A228033 Primes of the form 8^k + 5.

Original entry on oeis.org

13, 2787593149816327892691964784081045188247557, 15177100720513508366558296147058741458143803430094840009779784451085189728165691397

Offset: 1

Vincenzo Librandi, Aug 11 2013

a(4) = 8^64655 + 5 = 1.919...*10^58389 is too large to include. - Amiram Eldar, Jul 23 2025

Cf. A217355 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A182330 (k=5, h=2), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), this sequence (k=8, h=5), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [1..300] | IsPrime(a) where a is 8^n+5];

Select[Table[8^n + 5, {n, 4000}], PrimeQ]

A228028 Primes of the form 5^n + 4.

Original entry on oeis.org

5, 29, 15629, 9765629

Offset: 1

Vincenzo Librandi, Aug 11 2013

nonn

Vincenzo Librandi, Table of n, a(n) for n = 1..8

Cf. A124621 (associated n).

Cf. Primes of the form k^n + h: A092506 (k=2, h=1), A057733 (k=2, h=3), A123250 (k=2, h=5), A104066 (k=2, h=7), A104070 (k=2, h=9), A057735 (k=3, h=2), A102903 (k=3, h=4), A102870 (k=3, h=8), A102907 (k=3, h=10), A290200 (k=4, h=1), A228027 (k=4, h=9), A182330 (k=5, h=2), this sequence (k=5, h=4), A228029 (k=5, h=6), A102910 (k=5, h=8), A182331 (k=6, h=1), A104118 (k=6, h=5), A104115 (k=6, h=7), A104065 (k=7, h=4), A228030 (k=7, h=6), A228031 (k=7, h=10), A228032 (k=8, h=3), A228033 (k=8, h=5), A144360 (k=8, h=7), A145440 (k=8, h=9), A228034 (k=9, h=2), A159352 (k=10, h=3), A159031 (k=10, h=7).

[a: n in [0..200] | IsPrime(a) where a is  5^n+4];

Select[Table[5^n + 4, {n, 0, 200}], PrimeQ]

Corrected cross-references - Robert Price, Aug 01 2017

A267945 Primes that are a prime power plus two.

Original entry on oeis.org

5, 7, 11, 13, 19, 29, 31, 43, 61, 73, 83, 103, 109, 127, 139, 151, 181, 193, 199, 229, 241, 271, 283, 313, 349, 421, 433, 463, 523, 571, 601, 619, 643, 661, 811, 823, 829, 859, 883

Offset: 1

Robert C. Lyons, Jan 22 2016

nonn

The term 'prime power' refers to the elements of A246655.
If we were to extend the definition of prime power to include 1, then 3 would be the first term of the sequence, because 3 = 2^0 + 2.
The sequence is probably infinite, since it includes all the terms of A006512 (Greater of twin primes).
From Robert Israel, Jan 22 2016: (Start)
Since 3 divides p or p^k+2 if k is even, the only terms of the form p^k+2 where k is even are A228034.
All terms not in A057735 are congruent to 1 mod 3.
The generalized Bunyakovsky conjecture implies that for any odd k, there are infinitely many terms of the form p^k+2. (End)

			5 is in the sequence because 5 = 3^1 + 2.
7 is in the sequence because 7 = 5^1 + 2.
11 is in the sequence because 11 = 3^2 + 2.
13 is in the sequence because 13 = 11^1 + 2.
29 is in the sequence because 29 = 3^3 + 2.

Robert Israel, Table of n, a(n) for n = 1..10000
Wikipedia, Generalized Bunyakovsky conjecture

Cf. A000961, A057735, A228034, A246655, A267944.

select(t -> isprime(t) and nops(numtheory:-factorset(t-2))=1, [ seq(i,i=3..1000, 2)]); # Robert Israel, Jan 22 2016

A267945Q = PrimeQ@# && (Length@# == 1 && #[[1, 1]] > 1 &@FactorInteger[# - 2]) & (* JungHwan Min, Jan 25 2016 *)
Select[Array[Prime, 100], Length@# == 1 && #[[1, 1]] > 1 &@FactorInteger[# - 2] &] (* JungHwan Min, Jan 25 2016 *)

lista(nn) = {forprime(p=2, nn, if (isprimepower(p-2), print1(p, ", ")););} \\ Michel Marcus, Jan 22 2016

filter( is_prime, [ n+2 for n in prime_powers( 1, 1000 ) ] )

A229222 Smallest prime p such that p contains a digit larger than 1 and the sum of the n-th powers of the decimal digits of p is a prime number.

Original entry on oeis.org

2, 23, 113, 23, 191, 223, 191, 41, 223, 113, 157, 191, 137, 113, 113, 43, 137, 191, 179, 337, 577, 223, 227, 113, 263, 113, 199, 229, 263, 199, 467, 89, 223, 179, 223, 113, 443, 683, 1279, 337, 661, 463, 827, 2281, 577, 223, 223, 661, 137, 229, 11399, 461, 577

Offset: 1

Michel Lagneau, Sep 16 2013

We impose the condition that p is not in A020449 in order to avoid trivial sequences with infinite repetitions with the numbers 11 if p>1, or 101 if p>11, or 101111 if p > 101, ... for example if p > 1 the sequence is {2, 11, 11, 11, ...}, if p > 11 the sequence is {23, 23, 101, 23, 101, 101, 41, 101, 101, 101, 101, 101, ...}.
a(n) is an unification of a family of sequences mentioned hereafter:
A082101: primes of the form 2^n+3^n => 23 is in the sequence;
A057735: primes of the form 3^n+2 => 113 is in the sequence;
A153133: primes of the form 2^n+3^(n-1) => 223 is in the sequence;
A228034: primes of the form 9^n+2 => 191 is in the sequence;
A057733: primes of the form 2^n+3 => 2111 is in the sequence;
A228026: primes of the form 4^n+3 => 4111 is in the sequence;
A228034: primes of the form 9^n+2 => 191 is in the sequence;
A182330: primes of the form 5^n+2 => 151 is in the sequence;
A111974: primes of the form 2*3^n+1 => 313 is in the sequence;
A102903: primes of the form 3^n+4 => 11113 is in the sequence.
In this sequence, we observe repetitions of numbers such that 23, 113, 223, 191, 199, 223,... and this problem is very difficult, because it is probable that there exists both finite and infinite repetitions according to the numbers: for example, if we consider the number 23 of this sequence, it is probable that the number of element "23" is finite (see the comment in A082101 for the primes of form 2^k + 3^k). But, if we consider the number 113 of this sequence, is the number of the elements "113" infinite ? (see A057735 with the primes of the form 2+3^n). We observe that a(n) = 113 for n = 3, 14, 15, 24, 26,..., 123, 126, 139,..., 386, 391, 494, ....

			a(3) = 113 because 1^3+1^3+3^3 = 29 is prime.

Michel Lagneau, Table of n, a(n) for n = 1..500

Cf. A020449.

with(numtheory) :lst:={11, 101, 101111, 10011101, 10101101, 10110011, 10111001, 11000111, 11100101, 11110111, 11111101 }:for n from 1 to 300 do :ii:=0:for k from 1 to 10^8 while(ii=0) do:x:=convert(k,base,10):n1:=nops(x):it:=0:jj:=0:s:= sum('x[i]^n', 'i'=1..n1):lst1:={k} intersect lst:if type(k,prime)=true and type(s,prime)=true and (lst1<>{k}) then ii:=1: printf(`%d, `,k):else fi:od:od:

Table[p = 2; While[d = IntegerDigits[p]; Union[d][[-1]] < 2 || ! PrimeQ[Total[d^n]],  p = NextPrime[p]]; p, {n, 60}]

a(n)=forprime(p=2,,my(d=digits(p)); if(vecmax(d)>1 && isprime(sum(i=1,#d,d[i]^n)), return(p))) \\ Charles R Greathouse IV, Sep 19 2013

cp's OEIS Frontend

A228026 Primes of the form 4^k + 3.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A228032 Primes of the form 8^n + 3.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Extensions

A228029 Primes of the form 5^n + 6.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Extensions

A228030 Primes of the form 7^n + 6.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Extensions

A228031 Primes of the form 7^n + 10.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Extensions

A228027 Primes of the form 4^k + 9.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A228033 Primes of the form 8^k + 5.

Views

Author

Keywords

Comments

Crossrefs

Programs

Magma

Mathematica

A228028 Primes of the form 5^n + 4.

Views

Author

Keywords

Links