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 A332676 #14 May 08 2020 15:17:54 %S A332676 283,1153,1723,2053,2143,3413,3583,3823,3853,4243,4273,4363,4483,4663, %T A332676 5323,5903,6133,6163,6343,6553,6793,6803,7253,7963,8243,8353,8543, %U A332676 8563,8783,8893,9283,9403,10223,10303,10433,10993,11093,11383,12253,12703,13063,13513,13933,14293,14983 %N A332676 Prime numbers p_k such that p_k == 3 (mod 10) and p_(k+1) == 3 (mod 10). %H A332676 Robert Israel, <a href="/A332676/b332676.txt">Table of n, a(n) for n = 1..10000</a> %H A332676 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 A332676 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. %p A332676 filter:= t -> isprime(t) and nextprime(t) mod 10 = 3: %p A332676 select(filter, [seq(i,i=3..20000,10)]); # _Robert Israel_, May 08 2020 %t A332676 First @ Transpose @ Select[Partition[Select[Range[20000], PrimeQ], 2, 1], Mod[First[#], 10] == 3 && Mod[Last[#], 10] == 3 &] (* _Amiram Eldar_, Feb 19 2020 *) %Y A332676 Cf. A030430 (1, any), A330366 (1, 1), A331555 (1, 3), A331324 (1, 7), A332674 (1, 9), A030431 (3, any), A332675 (3, 1), this sequence (3, 3), A030432 (7, any), A030433 (9, any) [where (a, b) means p_k == a (mod 10) and p_(k+1) == b (mod 10)]. %K A332676 nonn %O A332676 1,1 %A A332676 _A.H.M. Smeets_, Feb 19 2020