This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
[a: n in [1..300] | IsPrime(a) where a is 3*n^2-2];
Select[Table[3 n^2 - 2, {n, 1, 800}], PrimeQ]
23 is in the sequence because 3 * 3^2 - 4 = 27 - 4 = 23. 71 = 3 * 5^2 - 4. 143 is not in the sequence, because 3 * 7^2 - 4 = 143 but 11 * 13 = 143.
[a: n in [1..300] | IsPrime(a) where a is 3*n^2-4];
select(isprime, [seq(3*(2*k+1)^2-4, k = 1..1000)]); # Robert Israel, Nov 09 2014
Select[Table[3n^2 - 4, {n, 1000}], PrimeQ]
lista(nn) = for (k=0, nn, if (isprime(p=3*k^2-4), print1(p, ", "))); \\ Michel Marcus, Nov 19 2014, Feb 16 2016
[a: n in [2..300] | IsPrime(a) where a is 3*n^2-5];
Select[Table[3n^2-5,{n,2,1000}],PrimeQ]
p = 12; a = {}; Do[k = p x^2 - 1; If[PrimeQ[k], AppendTo[a, k]], {x, 1, 1000}]; a
[a: n in [2..300] | IsPrime(a) where a is 3*n^2-7];
Select[Table[3 n^2 - 7, {n, 2, 1000}], PrimeQ]
[a: n in [2..300] | IsPrime(a) where a is 3*n^2-8];
Select[Table[3n^2 - 8, {n, 2, 1000}], PrimeQ]
Comments