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.
k=17; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((17^n-5^n)/12) \\ Charles R Greathouse IV, Feb 17 2017
k=18; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((18^n-5^n)/13) \\ Charles R Greathouse IV, Feb 17 2017
k=19; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((19^n-5^n)/14) \\ Charles R Greathouse IV, Feb 17 2017
k=13; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((13^n-5^n)/8) \\ Charles R Greathouse IV, Feb 17 2017
k=14; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,200}]
is(n)=isprime((14^n-5^n)/9) \\ Charles R Greathouse IV, Feb 17 2017
k=16; Do[p=Prime[n]; f=(k^p-5^p)/(k-5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((16^n-5^n)/11) \\ Charles R Greathouse IV, Feb 17 2017
k=8; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((8^n+5^n)/13) \\ Charles R Greathouse IV, Feb 17 2017
k=14; Do[p=Prime[n]; f=(k^p+5^p)/(k+5); If[ PrimeQ[f], Print[p] ], {n,1,100}]
is(n)=isprime((14^n+5^n)/19) \\ Charles R Greathouse IV, Feb 17 2017
Select[Range[1, 10000], PrimeQ[(11^# - 6^#)/5] &]
for(n=1, 10000, if(isprime((11^n - 6^n)/5), print1(n, ", ")))
Select[Range[1, 10000], PrimeQ[(11^# - 7^#)/4] &]
for(n=1, 10000, if(isprime((11^n - 7^n)/4), print1(n, ", ")))
Comments