A072226 -id:A072226 - cp's OEIS frontend

A292015 Primes of the form Phi(k, 2), where Phi is the cyclotomic polynomial.

3, 7, 5, 31, 3, 127, 17, 73, 11, 13, 8191, 43, 151, 257, 131071, 524287, 683, 241, 2731, 262657, 331, 2147483647, 65537, 599479, 43691, 174763, 61681, 5419, 2796203, 4432676798593, 15790321, 2305843009213693951, 715827883, 145295143558111, 10052678938039

Offset: 1

Robert Price, Sep 07 2017

nonn

Robert Price, Table of n, a(n) for n = 1..89
Yves Gallot, Cyclotomic polynomials and prime numbers
Index entries for cyclotomic polynomials,values at X

Cf. A072226, A019320.

Select[Table[Cyclotomic[k,2], {k, 0, 100}], PrimeQ[#] &]

a(n) = A019320(A072226(n)). - Max Alekseyev, Apr 25 2018

A297415 Numbers k such that A019320(k) is in A217465.

Original entry on oeis.org

25, 36, 52, 92, 124, 306, 361, 630, 656, 1648, 1780, 2508, 3300, 3540, 5728, 6260, 6450, 7500, 10820, 12656, 14076, 14132, 18836, 20960, 23456, 24272, 35280, 43136

Offset: 1

Max Alekseyev, Dec 29 2017

Cf. A019320, A217465, A297412.

Set difference of A297414 and ({1} U A072226).

is_A297415(n) = my(m=polcyclo(n, 2)); (m>1) && Mod(2, m*(m+1))^m==2 && !ispseudoprime(m);

A211874 Primes of the form Phi_k(3), the k-th cyclotomic polynomial evaluated at 3.

Original entry on oeis.org

2, 7, 13, 61, 73, 547, 757, 1093, 4561, 6481, 368089, 398581, 530713, 797161, 42521761, 47763361, 2413941289, 23535794707, 282429005041, 374857981681, 144542918285300809, 150094634909578633, 13490012358249728401, 82064241848634269407

Offset: 1

Alexander Gruber, Feb 12 2013

nonn

Primes in A019321.

Cf. A138933, A072226, A153601.

Sort[Select[Cyclotomic[Range[1000], 3], PrimeQ]]

A250198 Numbers k such that the right Aurifeuillian primitive part of 2^k+1 is prime.

Original entry on oeis.org

2, 6, 10, 14, 18, 22, 30, 34, 38, 42, 54, 58, 66, 70, 90, 102, 110, 114, 126, 138, 170, 178, 242, 294, 314, 326, 350, 378, 462, 566, 646, 726, 758, 1150, 1242, 1302, 1482, 1558, 1638, 1710, 1770, 1970, 1994

Offset: 1

Eric Chen, Jan 18 2015

nonn

All terms are congruent to 2 modulo 4.
Let Phi_n(x) denote the n-th cyclotomic polynomial.
Numbers n such that Phi_{2nM(n)}(2) is prime.
Let J(n) = 2^n+1, J*(n) = the primitive part of 2^n+1, and this is Phi_{2n}(2).
Let M(n) = the Aurifeuillian M-part of 2^n+1, M(n) = 2^(n/2) + 2^((n+2)/4) + 1 for n congruent to 2 (mod 4).
Let M*(n) = GCD(M(n), J*(n)), this sequence lists all n such that M*(n) is prime.

			14 is in this sequence because the right Aurifeuillian primitive part of 2^14+1 is 29, which is prime.
26 is not in this sequence because the right Aurifeuillian primitive part of 2^26+1 is 8321, which equals 53 * 157 and is not prime.

Eric Chen, Gord Palameta, Factorization of Phi_n(2) for n up to 1280
Samuel Wagstaff, The Cunningham project
Eric W. Weisstein's World of Mathematics, Aurifeuillean Factorization.

Cf. A250197, A153443, A019320, A072226, A161508, A085601, A229768, A061443.

Select[Range[2000], Mod[#, 4] == 2 && PrimeQ[GCD[2^(#/2) + 2^((#+2)/4) + 1, Cyclotomic[2*#, 2]]] &]

isok(n) = isprime(gcd(2^(n/2) + 2^((n+2)/4) + 1, polcyclo(2*n, 2))); \\ Michel Marcus, Jan 27 2015

A250208 Ratio of the primitive part of 2^n-1 to the product of primitive prime factors of 2^n-1.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Eric Chen, Mar 02 2015

nonn

As with A178764, it can be shown that all terms are either 1 or prime.
a(2*3^n)   =  3 (n>=1).
a(4*5^n)   =  5 (n>=1).
a(3*7^n)   =  7 (n>=1).
a(10*11^n) = 11 (n>=1).
a(12*13^n) = 13 (n>=1).
a(8*17^n)  = 17 (n>=1).
a(18*19^n) = 19 (n>=1).
...
a(A014664(k)*prime(k)^n) = prime(k).
For other n (while Phi_n(2) is squarefree), a(n) = 1.
a(n) != 1 for n = {6, 18, 20, 21, 54, 100, 110, 136, 147, 155, 156, 162, ...}.
At least, a(A049093(n)) = 1. (In fact, since Phi_n(2) is not completely factored for n = 991, 1207, 1213, 1217, 1219, 1229, 1231, 1237, 1243, 1249, ..., so it is unknown whether they are squarefree or not, but it is likely that Phi_n(2) is squarefree for all n except 364 and 1755 (because it is likely 1093 and 3511 are the only two Wieferich primes), so a(991), a(1207), a(1213), ..., are likely to be 1.)

			a(11) = 1 since Phi_11(2) = (2^11-1)/(2-1) = 2047, and the primitive prime factors of 2^11-1 are 23 and 89, so a(11) = 2047/(23*89) = 1.
a(18) = 3 since Phi_18(2) = 2^6 - 2^3 + 1 = 57, and the only primitive prime factor of 2^18-1 is 19, so a(18) = 57/19 = 3.

Eric Chen, Table of n, a(n) for n = 1..990
Eric Chen, Table of n, a(n) for n = 1..1280 status (with unknown terms but all are conjectured to be 1)

Cf. A178764.

Cf. A001220, A237043, A093106, A049094, A049093, A014491, A072226, A161508.

a250208[n_] = If[n == 364, 1093, If[n == 1755, 3511, GCD[Cyclotomic[n, 2], n]]]; Table[a250208[n], {n, 0, 200}]

a(n) = if (n==364, 1093, if (n==1755, 3511, gcd(polcyclo(n, 2), n)));

isprimitive(p, n) = {for (r=1, n-1, if (((2^r-1) % p) == 0, return (0)); ); return (1); }
ppf(n) = {my(pf = factor(2^n-1)[,1]); prod(k=1,#pf, if (isprimitive(pf[k], n), pf[k], 1));}
a(n) = if (issquarefree(m=polcyclo(n,2)), gcd(m, n), m/ppf(n)); \\ Michel Marcus, Mar 06 2015

a(n) = A019320(n) / A064078(n) while Phi_n(2) is squarefree.
a(n) = GCD(Phi_n(2), n) while Phi_n(2) is squarefree.
Notice: a(364) = 1093, a(1755) = 3511. (See A001220.)

A333973 Numbers k such that A019320(k) is greater than A064078(k) and the latter is a prime or a prime power.

Original entry on oeis.org

18, 20, 21, 54, 147, 342, 602, 889, 258121

Offset: 1

Jeppe Stig Nielsen, Sep 22 2020

The unique prime factor of A064078(k) is then a unique prime to base 2 (see A161509), but not a cyclotomic number.
Subsequence of A161508. In fact, subsequence of the set difference A161508 \ A072226.
In all known examples, A064078(k) is a prime. If A064078(k) was a prime power p^j with j>1, then p would be both a Wieferich prime (A001220) and a unique prime to base 2.
Subsequence of A093106 (the characterization of A093106 can be useful when searching for more terms).
Should this sequence be infinite?

Henri Lifchitz and Renaud Lifchitz, Phi(258121,2)/719.
Wikipedia, Unique prime, section Binary unique primes.

Cf. A019320, A064078, A093106, A072226, A144755, A161508, A161509, A247071.

for(n=1,+oo,c=polcyclo(n,2); c % n < 2 && next(); c/=(c%n); ispseudoprime(if(ispower(c,,&b),b,c))&&print1(n, ", "))

A250203 Numbers n such that the Phi_n(2) is the product of exactly two primes and is divisible by 2n+1.

Original entry on oeis.org

11, 20, 23, 35, 39, 48, 83, 96, 131, 231, 303, 375, 384, 519, 771, 848, 1400, 1983, 2280, 2640, 2715, 3359, 6144, 7736, 7911, 11079, 13224, 16664, 24263, 36168, 130439, 406583

Offset: 1

Eric Chen, Mar 13 2015

Here Phi_n is the n-th cyclotomic polynomial.
Is this sequence infinite?
Phi_n(2)/(2n+1) is only a probable prime for n > 16664.
a(33) > 2000000.
Subsequence of A005097 (2 * a(n) + 1 are all primes)
Subsequence of A081858.
2 * a(n) + 1 are in A115591.
Primes in this sequence are listed in A239638.
A085021(a(n)) = 2.
All a(n) are congruent to 0 or 3 (mod 4). (A014601)
All a(n) are congruent to 0 or 2 (mod 3). (A007494)
Except the term 20, all even numbers in this sequence are divisible by 8.

			Phi_11(2) = 23 * 89 and 23 = 2 * 11 + 1, so 11 is in this sequence.
Phi_35(2) = 71 * 122921 and 71 = 2 * 35 + 1, so 35 is in this sequence.
Phi_48(2) = 97 * 673 and 97 = 2 * 48 + 1, so 48 is in this sequence.

Eric Chen, Gord Palameta, Factorization of Phi_n(2) for n up to 1280
Will Edgington, Factorization of completely factored Phi_n(2) [from Internet Archive Wayback Machine]
Henri Lifchitz and Renaud Lifchitz, PRP records. Search for (2^a-1)/b
Samuel Wagstaff, The Cunningham project

Cf. A239638, A085724, A072226, A005384, A005097, A081858, A014601, A014664, A001917, A115591.

Select[Range[10000], PrimeQ[2*# + 1] && PowerMod[2, #, 2*# + 1] == 1 &&
PrimeQ[Cyclotomic[#, 2]/(2*#+1)] &]

isok(n) = if (((x=polcyclo(n, 2)) % (2*n+1) == 0) && (omega(x) == 2), print1(n, ", ")); \\ Michel Marcus, Mar 13 2015

A252353 Numbers k such that Phi(k, 12) is prime, where Phi is the cyclotomic polynomial.

Original entry on oeis.org

1, 2, 3, 5, 10, 12, 19, 21, 22, 56, 60, 63, 70, 80, 84, 92, 97, 109, 111, 123, 164, 189, 218, 276, 317, 353, 364, 386, 405, 456, 511, 636, 675, 701, 793, 945, 1090, 1268, 1272, 1971, 2088, 2368, 2482, 2893, 2966, 3290, 4161, 4320, 4533, 4744, 6357, 7023, 7430, 7737, 9499, 9739

Offset: 1

Eric Chen, Dec 16 2014

nonn

Numbers k such that A019330(k) is prime.
With some exceptions, terms of sequence are such that 12^n - 1 has only one primitive prime factor. 20 is an instance of such an exception, since 12^20 - 1 has a single primitive prime factor, 85403261, but Phi(20, 12) is divisible by 5, it is not prime.
a(n) is a duodecimal unique period length.

			n         Phi(n, 12)
1         11
2         13
3         157
4         5 * 29
5         22621
6         7 * 19
7         659 * 4943
8         89 * 233
9         37 * 80749
10        19141
11        11 * 23 * 266981089
12        20593
etc.

Cf. A019330, A072226, A138919-A138940.

Select[Range[1728], PrimeQ[Cyclotomic[#, 12]] &]

for( i=1, 1728, ispseudoprime( polcyclo(i, 12)) && print1( i", "))

More terms from Michel Marcus, Dec 18 2014

More terms from Amiram Eldar, Mar 26 2021

cp's OEIS Frontend

A292015 Primes of the form Phi(k, 2), where Phi is the cyclotomic polynomial.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A297415 Numbers k such that A019320(k) is in A217465.

Views

Author

Keywords

Crossrefs

Programs

PARI

A211874 Primes of the form Phi_k(3), the k-th cyclotomic polynomial evaluated at 3.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

A250198 Numbers k such that the right Aurifeuillian primitive part of 2^k+1 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A250208 Ratio of the primitive part of 2^n-1 to the product of primitive prime factors of 2^n-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A333973 Numbers k such that A019320(k) is greater than A064078(k) and the latter is a prime or a prime power.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A250203 Numbers n such that the Phi_n(2) is the product of exactly two primes and is divisible by 2n+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A252353 Numbers k such that Phi(k, 12) is prime, where Phi is the cyclotomic polynomial.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions