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.
p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1(p, ", ")); \\ Modified by Jinyuan Wang, Feb 22 2020
Select[Prime[Range[17*10^5]],Mod[Prime[#],#]==2&] (* Harvey P. Dale, Dec 28 2022 *)
p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p-2)%c & next; print1( c","))
Select[Range[52000],Mod[Prime[Prime[#]]+2,Prime[#]]==0&] (* Harvey P. Dale, Jul 12 2022 *)
p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( primepi(c)","))
Comments