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 A331324 #31 Oct 17 2022 11:01:07
%S A331324 31,61,131,151,251,271,331,541,571,601,751,941,971,991,1181,1231,1291,
%T A331324 1321,1361,1601,1621,1741,1831,1861,1901,2011,2131,2221,2251,2281,
%U A331324 2341,2351,2371,2411,2441,2551,2671,2791,2851,3061,3121,3181,3301,3391,3511,3541,3631,3691,3761,3911
%N A331324 Prime numbers p_k such that p_k == 1 (mod 10) and p_(k+1) == 7 (mod 10).
%H A331324 Harvey P. Dale, <a href="/A331324/b331324.txt">Table of n, a(n) for n = 1..1000</a>
%H A331324 R. J. Lemke Oliver and K. Soundararajan, <a href="http://arxiv.org/abs/1603.03720">Unexpected biases in the distribution of consecutive primes</a>, arXiv:1603.03720 [math.NT], 2016.
%H A331324 R. J. Lemke Oliver and K. Soundararajan, <a href="https://doi.org/10.1073/pnas.1605366113">Unexpected biases in the distribution of consecutive primes</a>, Proceedings of the National Academy of Sciences of the United States of America, Vol. 113, No. 31 (2016), E4446-E4454.
%t A331324 First @ Transpose @ Select[Partition[Select[Range[4500], PrimeQ], 2, 1], Mod[First[#], 10] == 1 && Mod[Last[#],10] == 7 &] (* _Amiram Eldar_, Jan 20 2020 *)
%t A331324 Prime[#]&/@SequencePosition[Mod[Prime[Range[600]],10],{1,7}][[All,1]] (* _Harvey P. Dale_, Oct 17 2022 *)
%o A331324 (Magma) [p: p in PrimesUpTo(4400)| (p mod 10 eq 1) and (NextPrime(p) mod 10 eq 7)]; // _Marius A. Burtea_, Jan 20 2020
%Y A331324 Cf. A030430 (1, any), A330366 (1, 1), A331555 (1, 3), this sequence (1, 7), A030431 (3, any), A030432 (7, any), A030433 (9, any) [where (a, b) means p_k == a (mod 10) and p_(k+1) == b (mod 10)].
%K A331324 nonn
%O A331324 1,1
%A A331324 _A.H.M. Smeets_, Jan 20 2020