cp's OEIS Frontend

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.

A332675 Prime numbers p_k such that p_k == 3 (mod 10) and p_(k+1) == 1 (mod 10).

This page as a plain text file.
%I A332675 #12 Mar 06 2020 19:37:04
%S A332675 523,683,743,983,1163,1193,1373,1523,1733,1823,1913,2003,2153,2213,
%T A332675 2243,2273,2503,2663,2843,3623,3803,4373,4423,4463,4583,4603,4703,
%U A332675 4733,4943,5483,5573,5693,5783,5813,5953,6113,6143,6203,6473,6833,6983,7393,7433,7673,7883,8093,8513,8573
%N A332675 Prime numbers p_k such that p_k == 3 (mod 10) and p_(k+1) == 1 (mod 10).
%H A332675 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 A332675 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 A332675 First @ Transpose @ Select[Partition[Select[Range[10^4], PrimeQ], 2, 1], Mod[First[#], 10] == 3 && Mod[Last[#], 10] == 1 &] (* _Amiram Eldar_, Feb 19 2020 *)
%Y A332675 Cf. A030430 (1, any), A330366 (1, 1), A331555 (1, 3), A331324 (1, 7), A332674 (1, 9), A030431 (3, any), this sequence (3, 1), A332676 (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 A332675 nonn
%O A332675 1,1
%A A332675 _A.H.M. Smeets_, Feb 19 2020