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 A253972 #13 Aug 28 2024 19:46:46 %S A253972 3,11,53,59,61,71,73,107,113,139,157,173,179,191,227,233,239,257,283, %T A253972 293,311,317,347,353,373,419,431,433,523,541,547,557,593,599,601,631, %U A253972 653,659,677,691,733,773,787,811,827,919,941,953,977,1013,1019,1031,1033 %N A253972 Primes p such that p + nextprime(p) is divisible by 8. %H A253972 Harvey P. Dale, <a href="/A253972/b253972.txt">Table of n, a(n) for n = 1..1000</a> %e A253972 p=59 is in this sequence because 59+61 = 120 is divisible by 8. %t A253972 Prime@Select[Range[300], Mod[Prime[#] + Prime[# + 1], 8]==0 &] %t A253972 Select[Partition[Prime[Range[200]],2,1],Mod[Total[#],8]==0&][[;;,1]] (* _Harvey P. Dale_, Aug 28 2024 *) %o A253972 (Magma) [p: p in PrimesUpTo(1500) | (p+NextPrime(p)) mod 8 eq 0]; %o A253972 (PARI) forprime(p=1,10^3,if(!((p+nextprime(p+1))%8),print1(p,", "))) \\ _Derek Orr_, Jan 30 2015 %Y A253972 Cf. similar sequences listed in A253969. %K A253972 nonn,easy %O A253972 1,1 %A A253972 _Vincenzo Librandi_, Jan 23 2015