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.
[n: n in [0..1000] | IsPrime(19^n+4)]; // Vincenzo Librandi, Oct 16 2014
Select[Range[0, 10000], PrimeQ[19^# + 4] &] (* Vincenzo Librandi, Oct 16 2014 *)
for(n=0, 10^5, if(ispseudoprime(19^n+4), print1(n, ", ")))
[n: n in [0..300] | IsPrime(15^n+4)]; // Vincenzo Librandi, Dec 01 2015
a247166[n_Integer] := Select[Range[n], PrimeQ[15^# + 4] &]; a247166[10^4] (* Michael De Vlieger, Dec 03 2014 *)
for(n=0, 1e5, if(ispseudoprime(15^n+4), print1(n, ", ")))
Select[Range[5000], PrimeQ[9^# + 8] &]
is(n)=ispseudoprime(9^n+8) \\ Charles R Greathouse IV, Jun 13 2017
For k = 0: 17^0 + 4 = 5, which is prime, so 0 is a term of the sequence. For k = 2: 17^2 + 4 = 293, which is prime, so 2 is a term of the sequence.
Select[Range@10^5, PrimeQ[17^# + 4] &] (* Michael De Vlieger, Jan 03 2015 *)
for(n=0, 1e5, if(ispseudoprime(17^n+4), print1(n, ", ")))
Comments