A006314 -id:A006314 - 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

A014825 a(n) = 4*a(n-1) + n with n > 1, a(1)=1.

Original entry on oeis.org

1, 6, 27, 112, 453, 1818, 7279, 29124, 116505, 466030, 1864131, 7456536, 29826157, 119304642, 477218583, 1908874348, 7635497409, 30541989654, 122167958635, 488671834560, 1954687338261, 7818749353066

Offset: 1

N. J. A. Sloane

			G.f. = x + 6*x^2 + 27*x^3 + 112*x^4 + 453*x^5 + 1818*x^6 + 7279*x^7 + ...

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Dillan Agrawal, Selena Ge, Jate Greene, Tanya Khovanova, Dohun Kim, Rajarshi Mandal, Tanish Parida, Anirudh Pulugurtha, Gordon Redwine, Soham Samanta, and Albert Xu, Chip-Firing on Infinite k-ary Trees, arXiv:2501.06675 [math.CO], 2025. See pp. 9, 18.
Hacène Belbachir and El-Mehdi Mehiri, Enumerating moves in the optimal solution of the Tower of Hanoi, arXiv:2210.08657 [math.CO], 2022.
László Tóth, On Schizophrenic Patterns in b-ary Expansions of Some Irrational Numbers, arXiv:2002.06584 [math.NT], 2020. See also Proc. Amer. Math. Soc. 148 (2020), 461-469.
Index entries for linear recurrences with constant coefficients, signature (6,-9,4).

Cf. A002450 (first differences), A052161 (partial sums).
Cf. A001045, A006314, A014916, A053142, A091919.
Cf. A171654 (mod 10).

[(4^(n+1)-3*n-4)/9: n in [1..30]]; // Vincenzo Librandi, Aug 23 2011

RecurrenceTable[{a[1]==1,a[n]==4a[n-1]+n},a[n],{n,30}] (* Harvey P. Dale, Oct 12 2011 *)
a[ n_]:= SeriesCoefficient[x/((1-4x)(1-x)^2), {x, 0, n}] (* Michael Somos, Jun 20 2012 *)

{a(n) = polcoeff( x / ((1 - x)^2 * (1 - 4*x)) + x * O(x^n), n)} /* Michael Somos, Jun 20 2012 */

def A014825(n): return (((1<<(n+1<<1))-4)//3-n)//3 # Chai Wah Wu, Nov 12 2024

[(4^(n+1) -3*n -4)/9 for n in (1..30)] # G. C. Greubel, Feb 18 2020

a(n) = (4^(n+1) - 3*n - 4)/9.
G.f.: x/((1-4*x)*(1-x)^2).
a(n) = Sum_{k=0..n} (n-k)*4^k = Sum_{k=0..n} k*4^(n-k). - Paul Barry, Jul 30 2004
a(n) = Sum_{k=0..n} binomial(n+2, k+2)*3^k [Offset 0]. - Paul Barry, Jul 30 2004
a(n) = Sum_{k=0..n} Sum_{j=0..2k} (-1)^(j+1)*J(j)*J(2k-j), J(n) = A001045(n). - Paul Barry, Oct 23 2009
Convolution square of A006314. - Michael Somos, Jun 20 2012
E.g.f.: (4*exp(4*x) - (4+3*x)*exp(x))/9. - G. C. Greubel, Feb 18 2020
a(n) = A014916(-n-1)*4^(n+1) = A091919(2*n-2) for all n in Z. - Michael Somos, Oct 02 2020
a(n) = Sum_{k=0..n} A002450(k). - Joseph Brown, May 11 2021
Last digits give A171654. - Paul Curtz, Oct 10 2021

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

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

A070020 At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers.

Original entry on oeis.org

6, 12, 138, 150, 192, 348, 642, 1020, 1092, 1230, 1620, 1788, 1932, 2112, 2142, 2238, 2658, 2688, 2730, 3330, 3540, 3918, 4002, 4158, 5010, 5640, 6090, 6450, 6552, 6702, 7950, 8088, 9000, 9042, 9240, 9462, 9768, 10008, 10092, 10272, 10302, 10332

Offset: 1

Labos Elemer, May 07 2002

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

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

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..5000 from Michael De Vlieger)

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

psQ[n_]:=And@@PrimeQ[{n-1,n+1,n^2+n+1}]; Select[Range[11000],psQ] (* Harvey P. Dale, Nov 05 2011 *)
Select[Range[10500], AllTrue[Cyclotomic[Range@ 3, #], PrimeQ] &] (* Michael De Vlieger, Dec 08 2018 *)

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

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

Original entry on oeis.org

1068630, 1441590, 1867950, 3429300, 4084230, 5651730, 6322890, 6770610, 7158630, 7804830, 9437760, 9624270, 13625850, 23194860, 25848840, 26588520, 28714950, 29451840, 32984430, 33650580, 36500910, 38177130, 42856590, 49531020, 50016540, 50222070, 52083330, 54637590

Offset: 1

Labos Elemer, May 07 2002

Numbers k such that C1(k) = k-1, C2(k) = k+1, C3(k) = k^2+k+1, C4(k) = k^2+1 and C5(k) = k^4+k^3+k^2+k+1 are all primes.

			For k = 1068630: the 1st, 2nd, 3rd, 4th and 5th cyclotomic polynomials give a quintet of primes: {1068629, 1068631, 1141971145531, 1141970076901, 1304096876879617162402531}.

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, A070025.

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

More terms from Don Reble, May 11 2002

a(24)-a(28) from Amiram Eldar, Sep 24 2024

A250175 Numbers n such that Phi_15(n) is prime, where Phi is the cyclotomic polynomial.

Original entry on oeis.org

2, 3, 11, 17, 23, 43, 46, 52, 53, 61, 62, 78, 84, 88, 89, 92, 99, 108, 123, 124, 141, 146, 154, 156, 158, 163, 170, 171, 182, 187, 202, 217, 219, 221, 229, 233, 238, 248, 249, 253, 264, 274, 275, 278, 283, 285, 287, 291, 296, 302, 309, 314, 315, 322, 325, 342, 346, 353, 356, 366, 368, 372, 377, 380, 384, 394, 404, 406, 411, 420, 425

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), A246392 (10), A162862(11), A246397 (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).

Select[Range[600], PrimeQ[Cyclotomic[15, #]] &] (* Vincenzo Librandi, Jan 16 2015 *)

isok(n) = isprime(polcyclo(15, n)); \\ Michel Marcus, Jan 16 2015

More terms from Vincenzo Librandi, Jan 16 2015

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A014825 a(n) = 4*a(n-1) + n with n > 1, a(1)=1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Sage

Formula

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

Views

Author

Keywords

Links

Crossrefs

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.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A070020 At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica