A231612
Numbers n such that the four fourth-degree cyclotomic polynomials are simultaneously prime.
Original entry on oeis.org
2, 90750, 194468, 229592, 388332, 868592, 1054868, 1148390, 1380380, 1415920, 1461372, 1496010, 1614800, 1706398, 1992210, 2439042, 2478212, 2644498, 2791910, 3073300, 3264448, 3824370, 3892780, 3939222, 3941938, 4425970, 4468980, 4594138, 4683700
Offset: 1
Cf.
A014574 (first degree solutions: average of twin primes).
Cf.
A087277 (similar, but with second-degree cyclotomic polynomials).
Cf.
A231613 (similar, but with sixth-degree cyclotomic polynomials).
Cf.
A231614 (similar, but with eighth-degree cyclotomic polynomials).
-
Select[Range[5000000], PrimeQ[Cyclotomic[5, #]] && PrimeQ[Cyclotomic[8, #]] && PrimeQ[Cyclotomic[10, #]] && PrimeQ[Cyclotomic[12, #]] &]
Select[Range[47*10^5],AllTrue[Thread[Cyclotomic[{5,8,10,12},#]],PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Feb 22 2018 *)
A231613
Numbers n such that the four sixth-degree cyclotomic polynomials are simultaneously prime.
Original entry on oeis.org
32034, 162006, 339105, 458811, 1780425, 2989119, 2993100, 3080205, 4375404, 6129597, 6280221, 7565142, 8489820, 10268277, 11343741, 12065076, 13067295, 13333182, 15866508, 16472802, 17040537, 18028605, 19066758, 22633629, 24256362, 24365259, 25031349
Offset: 1
Cf.
A014574 (first degree solutions: average of twin primes).
Cf.
A087277 (similar, but with second-degree cyclotomic polynomials).
Cf.
A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf.
A231614 (similar, but with eighth-degree cyclotomic polynomials).
-
t = {}; n = 0; While[Length[t] < 30, n++; If[PrimeQ[Cyclotomic[7, n]] && PrimeQ[Cyclotomic[9, n]] && PrimeQ[Cyclotomic[14, n]] && PrimeQ[Cyclotomic[18, n]], AppendTo[t, n]]]; t
Select[Range[251*10^5],AllTrue[Cyclotomic[{7,9,14,18},#],PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Oct 29 2016 *)
A231614
Numbers n such that the five eighth-degree cyclotomic polynomials are simultaneously prime.
Original entry on oeis.org
4069124, 8919014, 8942756, 46503870, 75151624, 82805744, 189326670, 197155324, 271490544, 365746304, 648120564, 1031944990
Offset: 1
Cf.
A014574 (first degree solutions: average of twin primes).
Cf.
A087277 (similar, but with second-degree cyclotomic polynomials).
Cf.
A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf.
A231613 (similar, but with sixth-degree cyclotomic polynomials).
-
t = {}; n = 0; While[Length[t] < 6, n++; If[PrimeQ[Cyclotomic[15, n]] && PrimeQ[Cyclotomic[16, n]] && PrimeQ[Cyclotomic[20, n]] && PrimeQ[Cyclotomic[24, n]] && PrimeQ[Cyclotomic[30, n]], AppendTo[t, n]]]; t
Extended to 12 terms by
T. D. Noe, Dec 13 2013
A233512
The first n cyclotomic polynomials are simultaneously prime for these arguments.
Original entry on oeis.org
3, 4, 6, 150, 1068630, 6770610
Offset: 1
At x = 3, x-1 = 2, which is prime. At x = 4, x-1 = 3 and x+1 = 5, which are both prime. At x = 6, x-1 = 5, x+1 = 7, and x^2+x+1 = 43, which are all prime.
Cf.
A014574 (first degree solutions: average of twin primes).
Cf.
A087277 (similar, but with second-degree cyclotomic polynomials).
Cf.
A231612 (similar, but with fourth-degree cyclotomic polynomials).
Cf.
A231613 (similar, but with sixth-degree cyclotomic polynomials).
Cf.
A231614 (similar, but with eighth-degree cyclotomic polynomials).
-
t = {}; n = 0; len = 0; While[len < 6, n++; found = True; i = 1; While[found && i <= len + 1, found = PrimeQ[Cyclotomic[i, n]]; i++]; If[found && i > len + 1, AppendTo[t, n]; len++]]; t
A270269
Prime numbers with locations of right angle turns in the Ulam square spiral that are vertices of isosceles right triangles.
Original entry on oeis.org
3, 5, 7, 31, 37, 43, 8011, 8101, 8191, 920641, 921601, 922561, 3894703, 3896677, 3898651, 5902471, 5904901, 5907331, 7450171, 7452901, 7455631, 7482961, 7485697, 7488433, 36066031, 36072037, 36078043, 37155121, 37161217, 37167313, 39759331, 39765637, 39771943
Offset: 1
-
nn:=20000:T:=array(1..nn):a0:=1:kk:=0:
for p from 1 to nn do :
a1:=a0+floor(p/2):a0:=a1:
if isprime(a1)
then
kk:=kk+1:T[kk]:=a1:
else
fi:
od:
for n from 1 to kk-2 do:
d1:=T[n+2]-T[n+1]:d2:=T[n+1]-T[n]:
if d1=d2
then
printf("%d %d %d \n", T[n], T[n+1], T[n+2]):
else
fi:
od:
Showing 1-5 of 5 results.
Comments