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.
Select[ Prime[ Range[1, 100000] ], PrimeQ[ (19^# + 18^#)/37 ]& ]
is(n)=ispseudoprime((19^n+18^n)/37) \\ Charles R Greathouse IV, Jun 06 2017
Select[ Prime[ Range[1, 100000] ], PrimeQ[ (17^# + 4^#)/21 ]& ]
is(n)=ispseudoprime((17^n+4^n)/21) \\ Charles R Greathouse IV, May 22 2017
Select[Prime[Range[1, 100000]], PrimeQ[(17^# + 2^#)/19]&]
is(n)=ispseudoprime((17^n+2^n)/19) \\ Charles R Greathouse IV, Jun 06 2017
Select[ Prime[ Range[1, 100000] ], PrimeQ[ (17^# + 16^#)/33 ]& ]
is(n)=ispseudoprime((17^n+16^n)/33) \\ Charles R Greathouse IV, Jun 13 2017
k=16; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n, 1, 9592}]
is(n)=ispseudoprime((16^n+5^n)/21) \\ Charles R Greathouse IV, Jun 13 2017
k=18; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n, 1, 9592}]
is(n)=ispseudoprime((18^n+5^n)/23) \\ Charles R Greathouse IV, Jun 13 2017
k=17; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 9592} ]
is(n)=ispseudoprime((17^n+3^n)/20) \\ Charles R Greathouse IV, Jun 13 2017
Comments