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]
[a: n in [2..300] | IsPrime(a) where a is 3*n^2-5];
Select[Table[3n^2-5,{n,2,1000}],PrimeQ]
[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]
a(1) = 2 because 2*3 + 10 = 16, which is a square. a(1) = 2 because 3*(3 + 2)/3 - 3 = 2 is prime.
[a: k in [2..250] | IsPrime(a) where a is k*(k+2) div 3 - 3 ];
[p: p in PrimesUpTo(60000) | IsSquare(3*p+10)];
Select[Table[(k (k + 2))/3 - 3, {k, 2, 450}], PrimeQ]
forprime(p=2, 1e5, if(issquare(3*p+10), print1(p , ", "))) \\ Altug Alkan, Dec 05 2015
Comments