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.

A267550 Primes p such that p (mod 3) = p (mod 5) = p (mod 7).

This page as a plain text file.
%I A267550 #21 Sep 08 2022 08:46:15
%S A267550 2,107,211,317,421,631,947,1051,1367,1471,1787,1997,2207,2311,2417,
%T A267550 2521,2731,2837,3257,3361,3467,3571,3677,4201,4517,4621,4831,4937,
%U A267550 5147,5881,5987,6091,6197,6301,6827,7247,7351,7457,7561,7877,8087,8191,8297,8821,9137,9241,9661,9767,9871,10501
%N A267550 Primes p such that p (mod 3) = p (mod 5) = p (mod 7).
%C A267550 Or primes p such that p (mod 105) = {1, 2}.
%C A267550 In terms a(4227)...a(4246) their terminal digits alternate: 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7.
%H A267550 Harvey P. Dale, <a href="/A267550/b267550.txt">Table of n, a(n) for n = 1..1000</a>
%t A267550 Select[ Prime[ Range[10000]], (Mod[#,3] == Mod[#,5] == Mod[#,7]) &](*Or*)
%t A267550 Select[ Prime[ Range[10000]], 0 < Mod[#,105] < 3 &]
%t A267550 Select[Prime[Range[10000]],Length[Union[Mod[#,{3,5,7}]]]==1&] (* _Harvey P. Dale_, Oct 11 2019 *)
%o A267550 (Magma) [p: p in PrimesUpTo(10000) | p mod 3 eq p mod 5 and p mod 5 eq p mod 7]; // _Vincenzo Librandi_, Jan 17 2016
%o A267550 (PARI) lista(nn) = forprime(p=2, nn, if(p%3 == p%5 && p%5 == p%7, print1(p, ", "))); \\ _Altug Alkan_, Jan 25 2016
%Y A267550 Cf. A216145, A267540.
%K A267550 nonn,easy
%O A267550 1,1
%A A267550 _Mikk Heidemaa_, Jan 17 2016
%E A267550 More terms from _Vincenzo Librandi_, Jan 17 2016