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.
%I A156148 #10 Jul 12 2022 18:44:43 %S A156148 5,20,51891,51893 %N A156148 Numbers k such that prime(prime(k)) + 2 == 0 (mod prime(k)), where prime(p)=A000040(p) is the p-th prime. %C A156148 No additional terms up to k=500,000. - _Harvey P. Dale_, Jul 12 2022 %F A156148 a(n) = A000720(A156149(n)). %t A156148 Select[Range[52000],Mod[Prime[Prime[#]]+2,Prime[#]]==0&] (* _Harvey P. Dale_, Jul 12 2022 *) %o A156148 (PARI) p=c=0; until(0, until( isprime(c++), p=nextprime(p+1)); (p+2)%c & next; print1( primepi(c)",")) %Y A156148 Cf. A156155. %K A156148 hard,more,nonn %O A156148 1,1 %A A156148 _M. F. Hasler_, Feb 04 2009