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.

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

Original entry on oeis.org

31, 61, 131, 151, 251, 271, 331, 541, 571, 601, 751, 941, 971, 991, 1181, 1231, 1291, 1321, 1361, 1601, 1621, 1741, 1831, 1861, 1901, 2011, 2131, 2221, 2251, 2281, 2341, 2351, 2371, 2411, 2441, 2551, 2671, 2791, 2851, 3061, 3121, 3181, 3301, 3391, 3511, 3541, 3631, 3691, 3761, 3911
Offset: 1

Views

Author

A.H.M. Smeets, Jan 20 2020

Keywords

Crossrefs

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)].

Programs

  • Magma
    [p: p in PrimesUpTo(4400)| (p mod 10 eq 1) and (NextPrime(p) mod 10 eq 7)]; // Marius A. Burtea, Jan 20 2020
  • Mathematica
    First @ Transpose @ Select[Partition[Select[Range[4500], PrimeQ], 2, 1], Mod[First[#], 10] == 1 && Mod[Last[#],10] == 7 &] (* Amiram Eldar, Jan 20 2020 *)
    Prime[#]&/@SequencePosition[Mod[Prime[Range[600]],10],{1,7}][[All,1]] (* Harvey P. Dale, Oct 17 2022 *)