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 [0..16] | IsPrime(a) where a is 2^(2^n)+253];
Select[Table[2^(2^n) + 253, {n, 0, 15}], PrimeQ]
for(n=1,5, if(ispseudoprime(t=2^2^n+253), print1(t", "))) \\ Charles R Greathouse IV, Jun 08 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+267];
Select[Table[2^(2^n) + 267, {n, 0, 15}], PrimeQ]
for(n=0, 5, if(ispseudoprime(t=2^2^n+267), print1(t", "))) \\ Charles R Greathouse IV, Jun 08 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+301];
Select[Table[2^(2^n) + 301, {n, 0, 16}], PrimeQ]
for(n=1,20, if(ispseudoprime(t=2^2^n+301), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+331];
Select[Table[2^(2^n) + 331, {n, 0, 15}], PrimeQ]
for(n=1,6, if(ispseudoprime(t=2^2^n+331), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+357];
Select[Table[2^(2^n) + 357, {n, 0, 15}], PrimeQ]
for(n=0,8, if(ispseudoprime(t=2^2^n+357), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+427];
Select[Table[2^(2^n) + 427, {n, 0, 15}], PrimeQ]
for(n=1,5, if(ispseudoprime(t=2^2^n+427), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+463];
Select[Table[2^(2^n) + 463, {n, 0, 15}], PrimeQ]
for(n=1,7, if(ispseudoprime(t=2^2^n+463), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+487];
Select[Table[2^(2^n) + 487, {n, 0, 15}], PrimeQ]
for(n=0,8, if(ispseudoprime(t=2^2^n+357), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+597];
Select[Table[2^(2^n) + 597, {n, 0, 15}], PrimeQ]
for(n=0,6, if(ispseudoprime(t=2^2^n+597), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
[a: n in [0..16] | IsPrime(a) where a is 2^(2^n)+805];
Select[Table[2^(2^n) + 805, {n, 0, 15}], PrimeQ]
for(n=1,6, if(ispseudoprime(t=2^2^n+805), print1(t", "))) \\ Charles R Greathouse IV, Jun 07 2016
Comments