A006313 -id:A006313 - cp's OEIS frontend

A253854 Numbers b such that b^131072 + 1 is prime.

1, 62722, 130816, 228188, 386892, 572186, 689186, 909548, 1063730, 1176694, 1361244, 1372930, 1560730, 1660830, 1717162, 1722230, 1766192, 1955556, 2194180, 2280466, 2639850, 3450080, 3615210, 3814944, 4085818, 4329134, 4893072, 4974408, 5326454, 5400728, 5471814

Offset: 1

Felix Fröhlich, Jan 17 2015

Base values b yielding a generalized Fermat prime b^(2^k)+1 for k=17.

The first member exceeding 10^((10^6-1)/2^17) is known to be 42654182. - Jeppe Stig Nielsen, Jan 30 2016

Jeppe Stig Nielsen, Table of n, a(n) for n = 1..1243
C. K. Caldwell, 1560730^131072+1, The Largest Known Primes
C. K. Caldwell, Search result %^131072+1.
J. S. S. Nielsen, Generalized Fermat Primes sorted by base (see table at the bottom of the page)
PrimeGrid, PrimeGrid Primes - (GFN131072) Generalized Fermat Prime Search n=131072
PrimeGrid, Generalized Fermat statistics

Cf. A056993, A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A244150, A243959, A321323.

Missing term a(8) inserted by Jeppe Stig Nielsen, Jul 02 2015
a(13) from Felix Fröhlich, Nov 01 2015
a(14)-a(20) from Jeppe Stig Nielsen, Jan 30 2016
a(21)-a(31) from Jeppe Stig Nielsen, Sep 06 2017
a(1) = 1 inserted by Jeppe Stig Nielsen, Sep 10 2018

A321323 Numbers k such that k^(2^20) + 1 is prime (a generalized Fermat prime).

Original entry on oeis.org

1, 919444, 1059094, 1951734, 1963736, 3843236

Offset: 1

Jeppe Stig Nielsen, Nov 04 2018

Chris K. Caldwell, The Prime Database: 919444^1048576 + 1
Chris K. Caldwell, The Prime Database: 1059094^1048576 + 1
Chris K. Caldwell, The Prime Database: ?^1048576 + 1

Cf. A056993, A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002, A088361, A088362, A226528, A226529, A226530, A251597, A253854, A244150, A243959.

a(4) from Jeppe Stig Nielsen, Aug 31 2022
a(5) from Jeppe Stig Nielsen, Oct 21 2022
a(6) from Jeppe Stig Nielsen, Jan 11 2025

A104494 Positive integers n such that n^17 + 1 is semiprime (A001358).

Original entry on oeis.org

2, 58, 66, 166, 268, 270, 408, 600, 672, 808, 822, 970, 1050, 1090, 1150, 1200, 1212, 1380, 1578, 1752, 1912, 1950, 1986, 2016, 2038, 2292, 2340, 2548, 2590, 2656, 2718, 2800, 2856, 3162, 3300, 3342, 3738, 4138, 4152, 4228, 4270, 4272, 4362, 4782, 5080, 5166

Offset: 1

Jonathan Vos Post, Apr 19 2005

			2^17 + 1 = 131073 = 3 * 43691,
58^17 + 1 = 951208868148684143308060622849 = 59 * 16122184205909900734034925811,
66^17 + 1 = 8555529718761317069203003539457 = 67 * 127694473414348015958253784171,
1050^17 + 1 = 2292018317801032401637344360351562500000000000000001 = 1051 * 2180797638250268698037435166842590390104662226451.

Robert Price, Table of n, a(n) for n = 1..1000

Cf. A001358, A006313, A103854, A104238, A104335, A105041, A105066, A105078, A105122, A105142, A105237, A104479.

IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [n: n in [1..1200]|IsSemiprime(n^17+1)]; // Vincenzo Librandi, Mar 10 2015

Select[Range[1000000], PrimeQ[# + 1] && PrimeQ[(#^17 + 1)/(# + 1)] &] (* Robert Price, Mar 10 2015 *)
Select[Range[5200],PrimeOmega[#^17+1]==2&] (* Harvey P. Dale, Mar 07 2017 *)

for(n=1,3000,if(!ispseudoprime(n^17+1),forprime(p=1,10^4,if((n^17+1)%p==0,if(ispseudoprime((n^17+1)/p),print1(n,", "));break)))) \\ Derek Orr, Mar 09 2015

a(n)^17 + 1 is semiprime (A001358).

a(14)-a(46) from Robert Price, Mar 09 2015

A104479 Positive integers n such that n^16 + 1 is semiprime (A001358).

Original entry on oeis.org

3, 4, 9, 12, 14, 16, 18, 20, 26, 29, 40, 41, 48, 58, 70, 73, 81, 87, 92, 96, 104, 111, 113, 114, 118, 122, 130, 140, 142, 144, 146, 150, 157, 162, 164, 167, 168, 172, 173, 184, 187, 192, 194, 195, 199, 200, 202, 208, 220, 230, 232, 244, 253, 256, 266, 278, 292, 295, 298

Offset: 1

Jonathan Vos Post, Apr 18 2005

n^16 + 1 is an irreducible polynomial over Z and thus can be either prime (A006313) or semiprime.

			3^16 + 1 = 43046722 = 2 * 21523361,
4^16 + 1 = 4294967297 = 641 * 6 700417,
9^16 + 1 = 1853020188851842 = 2 * 926510094425921,
12^16 + 1 = 184884258895036417 = 153953 * 1200913648289,
200^16 + 1 = 6553600000000000000000000000000000001 =
162123499503471553 * 40423504427621041217.

Robert Price, Table of n, a(n) for n = 1..102

Cf. A006313, A001358, A085722, A096173, A186669, A104238, A103854, A105041, A105066, A105078, A105122, A105142, A105237, A104335, A104479, A104494, A104657, A105282.

IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [n: n in [2..300]|IsSemiprime(n^16+1)] // Vincenzo Librandi, Dec 21 2010

Select[Range[300],PrimeOmega[#^16+1]==2&] (* Harvey P. Dale, Aug 21 2011 *)
Select[Range[1000], 2 == Total[Transpose[FactorInteger[#^16 + 1]][[2]]] &] (* Robert Price, Mar 11 2015 *)

a(n)^16 + 1 is semiprime (A001358).

More terms from Vincenzo Librandi, Dec 21 2010

Corrected (adding 202, 208, and 220) by Harvey P. Dale, Aug 21 2011

A104657 Positive integers n such that n^19 + 1 is semiprime (A001358).

Original entry on oeis.org

2, 10, 28, 106, 190, 292, 556, 756, 858, 906, 1012, 1030, 1032, 1060, 1372, 1450, 1488, 1720, 1722, 1758, 1782, 1822, 1972, 2356, 2436, 2446, 2620, 2748, 2788, 2998, 3186, 3300, 3318, 3360, 3466, 3510, 3822, 3852, 4138, 4326, 4506, 4908, 5236, 5518, 5782

Offset: 1

Jonathan Vos Post, Apr 21 2005

We have the polynomial factorization: n^19 + 1 = (n + 1) * (n^18 - n^17 + n^16 - n^15 + n^14 - n^13 + n^12 - n^11 + n^10 - n^9 + n^8 - n^7 + n^6 - n^5 + n^4 - n^3 + n^2 - n + 1). Hence after the initial n=1 prime the binomial can never be prime. It can be semiprime iff n+1 is prime and (n^18 - n^17 + n^16 - n^15 + n^14 - n^13 + n^12 - n^11 + n^10 - n^9 + n^8 - n^7 + n^6 - n^5 + n^4 - n^3 + n^2 - n + 1) is prime.

			2^19 + 1 = 524289 = 3 * 174763,
10^19 + 1 = 10000000000000000001 = 11 * 909090909090909091,
1012^19 + 1 = 125438178100868833265294241234853844232270960601988910249 = 1013 * 1238284087866424810121364671617510801898035149081825373.

Robert Price, Table of n, a(n) for n = 1..1000

Cf. A001358, A006313, A103854, A104238, A104335, A105041, A105066, A105078, A105122, A105142, A105237, A104479, A104494.

IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [n: n in [1..1100]|IsSemiprime(n^19+1)]; // Vincenzo Librandi, Mar 10 2015

Select[Range[1000000], PrimeQ[# + 1] && PrimeQ[(#^19 + 1)/(# + 1)] &] (* Robert Price, Mar 10 2015 *)
Select[Range[5800],PrimeOmega[#^19+1]==2&] (* Harvey P. Dale, Feb 15 2019 *)

a(n)^19 + 1 is semiprime (A001358).

a(12)-a(45) from Robert Price, Mar 09 2015

A105282 Positive integers n such that n^20 + 1 is semiprime (A001358).

Original entry on oeis.org

2, 4, 46, 154, 266, 472, 748, 1434, 1738, 2058, 2204, 2222, 2428, 2478, 2510, 2866, 3132, 3288, 3576, 3688, 3756, 4142, 4506, 4940, 5164, 6252, 6330, 6786, 7180, 7300, 7338, 7416, 7628, 7806, 9270, 9312, 10044, 10722, 10860, 12126, 12422, 12668, 12998, 13350

Offset: 1

Jonathan Vos Post, Apr 25 2005

We have the polynomial factorization: n^20 + 1 = (n^4 + 1) * (n^16 - n^12 + n^8 - n^4 + 1). Hence after the initial n=1 prime, the binomial can never be prime. It can be semiprime iff n^4+1 is prime and (n^16 - n^12 + n^8 - n^4 + 1) is prime.

			2^20 + 1 = 1048577 = 17 * 61681,
4^20 + 1 = 1099511627777 = 257 * 4278255361,
46^20 + 1 = 1799519816997495209117766334283777 = 4477457 * 401906666439788301510827761,
1434^20 + 1 =
1352019721694375552250489804528860551814233886722212960509362177 =
4228599998737 * 319732233386510278346888399489424537759394853595121.

Robert Price, Table of n, a(n) for n = 1..1405

Cf. A000040, A001358, A006313, A103854, A104238, A104335, A105041, A105066, A105078, A105122, A105142, A105237, A104479, A104494, A104657.

IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [n: n in [1..1000] | IsSemiprime(n^20+1)] // Vincenzo Librandi, Dec 21 2010

Select[Range[1000000], PrimeQ[#^4 + 1] && PrimeQ[(#^20 + 1)/(#^4 + 1)] &] (* Robert Price, Mar 09 2015 *)

a(n)^20 + 1 is semiprime (A001358).

a(9)-a(44) from Robert Price, Mar 09 2015

A246397 Numbers n such that Phi(12, n) is prime, where Phi is the cyclotomic polynomial.

Original entry on oeis.org

2, 3, 4, 5, 9, 10, 12, 13, 17, 25, 27, 30, 31, 36, 38, 39, 43, 48, 52, 55, 56, 61, 62, 65, 83, 92, 94, 99, 100, 104, 105, 109, 114, 118, 126, 131, 166, 168, 169, 172, 183, 185, 190, 194, 196, 198, 209, 224, 225, 229, 231, 239, 244, 257, 260, 261, 263, 269, 270, 272, 278, 291, 296, 299, 300, 302, 308, 311

Offset: 1

Eric Chen, Nov 13 2014

nonn

Numbers n such that n^4-n^2+1 is prime, or numbers n such that A060886(n) is prime.

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A008864 (1), A006093 (2), A002384 (3), A005574 (4), A049409 (5), A055494 (6), A100330 (7), A000068 (8), A153439 (9), A246392 (10), A162862 (11), this sequence (12), A217070 (13), A006314 (16), A217071 (17), A164989 (18), A217072 (19), A217073 (23), A153440 (27), A217074 (29), A217075 (31), A006313 (32), A097475 (36), A217076 (37), A217077 (41), A217078 (43), A217079 (47), A217080 (53), A217081 (59), A217082 (61), A006315 (64), A217083 (67), A217084 (71), A217085 (73), A217086 (79), A153441 (81), A217087 (83), A217088 (89), A217089 (97), A006316 (128), A153442 (243), A056994 (256), A056995 (512), A057465 (1024), A057002 (2048), A088361 (4096), A088362 (8192), A226528 (16384), A226529 (32768), A226530 (65536).

Cf. A060886, A125258, A085398, A124990.

A246397:=n->`if`(isprime(n^4-n^2+1),n,NULL): seq(A246397(n),n=1..300); # Wesley Ivan Hurt, Nov 14 2014

Select[Range[350], PrimeQ[Cyclotomic[12, #]] &] (* Vincenzo Librandi, Jan 17 2015 *)

for(n=1,10^3,if(isprime(polcyclo(12,n)),print1(n,", "))); \\ Joerg Arndt, Nov 13 2014

A123599 Smallest generalized Fermat prime of the form a^(2^n) + 1, where base a>1 is an integer; or -1 if no such prime exists.

Original entry on oeis.org

3, 5, 17, 257, 65537, 185302018885184100000000000000000000000000000001

Offset: 0

Alexander Adamchuk, Nov 14 2006

nonn

First 5 terms {3, 5, 17, 257, 65537} = A019434 are the Fermat primes of the form 2^(2^n) + 1. Note that for all currently known a(n) up to n = 17 last digit is 7 or 1 (except a(0) = 3 and a(1) = 5). Corresponding least bases a>1 such that a^(2^n) + 1 is prime are listed in A056993.

The last-digit behavior clearly continues since, for any a, we have that a^(2^2) will be either 0 or 1 modulo 5. So for n >= 2, a(n) is 1 or 2 modulo 5, and odd. - Jeppe Stig Nielsen, Nov 16 2020

Charles R Greathouse IV, Table of n, a(n) for n = 0..9
Eric Weisstein's World of Mathematics, Generalized Fermat Number.

Cf. A000215, A019434, A056993.

Cf. A006093, A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002.

Do[f=Min[Select[ Table[ i^(2^n) + 1, {i, 2, 500} ],PrimeQ]];Print[{n,f}],{n,0,9}]

A250177 Numbers n such that Phi_21(n) is prime, where Phi is the cyclotomic polynomial.

Original entry on oeis.org

3, 6, 7, 12, 22, 27, 28, 35, 41, 59, 63, 69, 112, 127, 132, 133, 136, 140, 164, 166, 202, 215, 218, 276, 288, 307, 323, 334, 343, 377, 383, 433, 474, 479, 516, 519, 521, 532, 538, 549, 575, 586, 622, 647, 675, 680, 692, 733, 790, 815, 822, 902, 909, 911, 915, 952, 966, 1025, 1034, 1048, 1093

Offset: 1

Eric Chen, Dec 24 2014

nonn

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A008864 (1), A006093 (2), A002384 (3), A005574 (4), A049409 (5), A055494 (6), A100330 (7), A000068 (8), A153439 (9), A250392 (10), A162862 (11), A246397 (12), A217070 (13), A250174 (14), A250175 (15), A006314 (16), A217071 (17), A164989 (18), A217072 (19), A250176 (20), this sequence (21), A250178 (22), A217073 (23), A250179 (24), A250180 (25), A250181 (26), A153440 (27), A250182 (28), A217074 (29), A250183 (30), A217075 (31), A006313 (32), A250184 (33), A250185 (34), A250186 (35), A097475 (36), A217076 (37), A250187 (38), A250188 (39), A250189 (40), A217077 (41), A250190 (42), A217078 (43), A250191 (44), A250192 (45), A250193 (46), A217079 (47), A250194 (48), A250195 (49), A250196 (50), A217080 (53), A217081 (59), A217082 (61), A006315 (64), A217083 (67), A217084 (71), A217085 (73), A217086 (79), A153441 (81), A217087 (83), A217088 (89), A217089 (97), A006316 (128), A153442 (243), A056994 (256), A056995 (512), A057465 (1024), A057002 (2048), A088361 (4096), A088362 (8192), A226528 (16384), A226529 (32768), A226530 (65536), A251597 (131072), A244150 (524287), A243959 (1048576).

Cf. A085398 (Least k>1 such that Phi_n(k) is prime).

a250177[n_] := Select[Range[n], PrimeQ@Cyclotomic[21, #] &]; a250177[1100] (* Michael De Vlieger, Dec 25 2014 *)

{is(n)=isprime(polcyclo(21,n))};
for(n=1,100, if(is(n)==1, print1(n, ", "), 0)) \\ G. C. Greubel, Apr 14 2018

A070025 At these values of k, the 1st, 2nd, 3rd and 4th cyclotomic polynomials all give prime numbers.

Original entry on oeis.org

6, 150, 2730, 9000, 9240, 35280, 41760, 43050, 53280, 65520, 76650, 96180, 111030, 148200, 197370, 207480, 213360, 226380, 254280, 264600, 309480, 332160, 342450, 352740, 375450, 381990, 440550, 458790, 501030, 527070, 552030, 642360, 660810

Offset: 1

Labos Elemer, May 07 2002

Numbers k such that k-1, k+1, k^2+k+1 and k^2+1 are all primes.

			For k = 6: 5, 7, 43 and 37 are prime values of the first 4 cyclotomic polynomials.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A070155, A070156, A070157, A000068, A006313, A006314, A006315, A006316, A056993, A056994, A056995, A005574, A057465, A057002, A070020, A070042.

lst={};Do[If[PrimeQ[n-1]&&PrimeQ[n+1]&&PrimeQ[1+n+n^2]&&PrimeQ[1+n^2], AppendTo[lst, n]], {n, 10^6}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 19 2008 *)
Select[Range[10^6], Function[k, AllTrue[Cyclotomic[#, k] & /@ Range@ 4, PrimeQ]]] (* Michael De Vlieger, Jul 18 2017 *)

is(k) = isprime(k-1) && isprime(k+1) && isprime(k^2+1) && isprime(k^2+k+1); \\ Amiram Eldar, Sep 24 2024

cp's OEIS Frontend

A253854 Numbers b such that b^131072 + 1 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A321323 Numbers k such that k^(2^20) + 1 is prime (a generalized Fermat prime).

Views

Author

Keywords

Links

Crossrefs

Extensions

A104494 Positive integers n such that n^17 + 1 is semiprime (A001358).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A104479 Positive integers n such that n^16 + 1 is semiprime (A001358).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A104657 Positive integers n such that n^19 + 1 is semiprime (A001358).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A105282 Positive integers n such that n^20 + 1 is semiprime (A001358).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A246397 Numbers n such that Phi(12, n) is prime, where Phi is the cyclotomic polynomial.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A123599 Smallest generalized Fermat prime of the form a^(2^n) + 1, where base a>1 is an integer; or -1 if no such prime exists.